Bicyclic graphs with exactly two main signless Laplacian eigenvalues

2011/12/30 by Huang, He, Deng, Hanyuan
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1201.0050

Abstract

A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.

Related

• On the Main Signless Laplacian Eigenvalues of a Graph
• Graphs with zero as a main eigenvalue of the signless Laplacian
• Tricyclic graphs with exactly two main eigenvalues
• Tricyclic graphs with exactly two main eigenvalues
• Characterization of tricyclic graphs with exactly two Q-main eigenvalues