On signless Laplacian coefficients of unicyclic graphs with given matching number
Abstract
Let G be an unicyclic graph of order n and let QG(x)= det(xI-Q(G))=matrix Σi=1n (-1)i i xn-imatrix be the characteristic polynomial of the signless Laplacian matrix of a graph G. We give some transformations of G which decrease all signless Laplacian coefficients in the set G(n,m). G(n,m) denotes all n-vertex unicyclic graphs with matching number m. We characterize the graphs which minimize all the signless Laplacian coefficients in the set 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) of all n-vertex unicyclic graphs with odd (resp. even) girth.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.