Tricyclic graphs with exactly two main eigenvalues

Xiaoxia Fan, Yanfeng Luo, Xing Gao
2013 Open Mathematics  
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let G 0 be the graph obtained from G by deleting all pendant vertices and δ(G) the minimum degree of vertices of G. In this paper, all connected tricyclic graphs G with δ(G 0) ≥ 2 and exactly two main eigenvalues are determined.
doi:10.2478/s11533-013-0283-z fatcat:ugsqethjtndjrhpqopr7xndtli