English

On signless Laplacian coefficients of bicyclic graphs

Combinatorics 2012-12-24 v1

Abstract

Let GG be a graph of order nn and QG(x)=det(xIQ(G))=i=1n(1)iφixniQ_G(x)= det(xI-Q(G))= \sum_{i=1}^n (-1)^i \varphi_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 n4n-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 n5n-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.

Keywords

Cite

@article{arxiv.1212.5261,
  title  = {On signless Laplacian coefficients of bicyclic graphs},
  author = {Jie Zhang and Xiao-Dong Zhang},
  journal= {arXiv preprint arXiv:1212.5261},
  year   = {2012}
}

Comments

22 pages, 3 figures. arXiv admin note: substantial text overlap with arXiv:1212.5008