On signless Laplacian coefficients of unicyclic graphs with given matching number

preprint2012arXivOpen access

Abstract

Let GG be an unicyclic graph of order nn and let QG(x)=det(xI−Q(G))=matrix∑i=1n(−1)iφixn−imatrixQ_G(x)= det(xI-Q(G))={matrix} \sum_{i=1}^n (-1)^i φ_i x^{n-i}{matrix} be the characteristic polynomial of the signless Laplacian matrix of a graph GG. We give some transformations of GG which decrease all signless Laplacian coefficients in the set G(n,m)\mathcal{G}(n,m). G(n,m)\mathcal{G}(n,m) denotes all n-vertex unicyclic graphs with matching number mm. We characterize the graphs which minimize all the signless Laplacian coefficients in the set G(n,m)\mathcal{G}(n,m) with odd (resp. even) girth. Moreover, we find the extremal graphs which have minimal signless Laplacian coefficients in the set G(n)\mathcal{G}(n) of all nn-vertex unicyclic graphs with odd (resp. even) girth.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.