Abstract
Let be an unicyclic graph of order and let be the characteristic polynomial of the signless Laplacian matrix of a graph . We give some transformations of which decrease all signless Laplacian coefficients in the set . denotes all n-vertex unicyclic graphs with matching number . We characterize the graphs which minimize all the signless Laplacian coefficients in the set with odd (resp. even) girth. Moreover, we find the extremal graphs which have minimal signless Laplacian coefficients in the set of all -vertex unicyclic graphs with odd (resp. even) girth.
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.