Sharp spectral inequalities for connected bipartite graphs with maximal Q-index
Keywords:Double nested graph, signless Laplacian, largest eigenvalue, spectral inequalities.
AbstractThe Q-index of a simple graph is the largest eigenvalue of its signless Laplacian. As for the adjacency spectrum, we will show that in the set of connected bipartite graphs with fixed order and size, the bipartite graphs with maximal Q-index are the double nested graphs. We provide a sequence of (in)equalities regarding the principal eigenvector of the signless Laplacian of double nested graphs and apply these results to obtain some lower and upper bounds for their Q-index. In the end, we give some computational results in order to compare these bounds.
Special Issue Bled'11
Articles in this journal are published under Creative Commons Attribution 4.0 International License