Abstract
Let be a graph of order and let be the characteristic polynomial of its Laplacian matrix. Motivated by Ilić and Ilić's conjecture [A. Ilić, M. Ilić, Laplacian coefficients of trees with given number of leaves or vertices of degree two, Linear Algebra and its Applications 431(2009)2195-2202.] on all extremal graphs which minimize all the Laplacian coefficients in the set of all -vertex unicyclic graphs with the number of leaves , we investigate properties of the minimal elements in the partial set of the Laplacian coefficients, where denote the set of -vertex unicyclic graphs with the number of leaves and girth . These results are used to disprove their conjecture. Moreover, the graphs with minimum Laplacian-like energy in are also studied.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.