On signless Laplacian coefficients of bicyclic graphs
arXiv:1212.5261
Abstract
Let be a graph of order and be the characteristic polynomial of the signless Laplacian matrix of a graph . We give some transformations of which decrease all signless Laplacian coefficients in the set of all -vertex bicyclic graphs. denotes all n-vertex bicyclic graphs with at least one odd cycle. We show that (obtained from by adding one edge between two non-adjacent vertices and adding pendent vertices at the vertex of degree 3) minimizes all the signless Laplacian coefficients in the set . Moreover, we prove that (obtained from by adding pendent vertices at one vertex of degree 3) has minimum signless Laplacian coefficients in the set of all -vertex bicyclic graphs with two even cycles.
22 pages, 3 figures. arXiv admin note: substantial text overlap with arXiv:1212.5008