On signless Laplacian coefficients of bicyclic graphs

preprint2012arXivOpen access

Abstract

Let GG be a graph of order nn and QG(x)=det(xI−Q(G))=∑i=1n(−1)iφixn−iQ_G(x)= det(xI-Q(G))= \sum_{i=1}^n (-1)^i φ_i x^{n-i} 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 B(n)\mathcal{B}(n) of all nn-vertex bicyclic graphs. B1(n)\mathcal{B}^1(n) denotes all n-vertex bicyclic graphs with at least one odd cycle. We show that Bn1B_n^1 (obtained from C4C_4 by adding one edge between two non-adjacent vertices and adding n−4n-4 pendent vertices at the vertex of degree 3) minimizes all the signless Laplacian coefficients in the set B1(n)\mathcal{B}^1(n). Moreover, we prove that Bn2B_n^2 (obtained from K2,3K_{2,3} by adding n−5n-5 pendent vertices at one vertex of degree 3) has minimum signless Laplacian coefficients in the set B2(n)\mathcal{B}^2(n) of all nn-vertex bicyclic graphs with two even cycles.

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.