Computing some Laplacian Coefficients of Forests
Let G be a finite simple graph with Laplacian polynomial ψG,λ=∑k=0n−1n−kckλk. In an earlier paper, the coefficients cn−4 and cn−5 for forests with respect to some degree-based graph invariants were computed. The aim of this paper is to continue this work by giving an exact formula for the coefficien...
Saved in:
Main Authors: | Ali Ghalavand, Ali Reza Ashrafi |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2022-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2022/8199547 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Mostar and Edge Mostar Indices of Graphs
by: Ali Ghalavand, et al.
Published: (2021-01-01) -
On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with n Vertices and m Pendent Vertices
by: Xinying Pai, et al.
Published: (2012-01-01) -
Solvability of Some Boundary Value Problems for Fractional -Laplacian Equation
by: Taiyong Chen, et al.
Published: (2013-01-01) -
Some Existence Results of Positive Solutions for φ-Laplacian Systems
by: Xianghui Xu, et al.
Published: (2014-01-01) -
An Innovative Approach to Estimate Chloride Diffusion Coefficient in Submerged Concrete Structures Using Soft Computing
by: Seyyed Ali Habibi, et al.
Published: (2023-08-01)