On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with n Vertices and m Pendent Vertices
Let Φ(G,λ)=det(λIn-L(G))=∑k=0n(-1)kck(G)λn-k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. In this paper, we give four transforms on graphs that decrease all Laplacian coefficients ck(G) and investigate a conjecture A. Ilić and M. Ilić (2009) about the Laplacian c...
Saved in:
Main Authors: | Xinying Pai, Sanyang Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/404067 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Minimum General Sum-Connectivity of Trees of Fixed Order and Pendent Vertices
by: Abeer M. Albalahi, et al.
Published: (2022-01-01) -
Extremum Modified First Zagreb Connection Index of n-Vertex Trees with Fixed Number of Pendent Vertices
by: Sadia Noureen, et al.
Published: (2020-01-01) -
On Laplacian Equienergetic Signed Graphs
by: Qingyun Tao, et al.
Published: (2021-01-01) -
The Laplacian-Energy-Like Invariants of Three Types of Lattices
by: Zheng-Qing Chu, et al.
Published: (2016-01-01) -
Computing some Laplacian Coefficients of Forests
by: Ali Ghalavand, et al.
Published: (2022-01-01)