On signless Laplacian coefficients of bicyclic graphs
Abstract
Let G be a graph of order n and QG(x)= det(xI-Q(G))= Σi=1n (-1)i i xn-i 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 B(n) of all n-vertex bicyclic graphs. B1(n) denotes all n-vertex bicyclic graphs with at least one odd cycle. We show that Bn1 (obtained from C4 by adding one edge between two non-adjacent vertices and adding n-4 pendent vertices at the vertex of degree 3) minimizes all the signless Laplacian coefficients in the set B1(n). Moreover, we prove that Bn2 (obtained from K2,3 by adding n-5 pendent vertices at one vertex of degree 3) has minimum signless Laplacian coefficients in the set B2(n) of all n-vertex bicyclic graphs with two even cycles.
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.