Department of Mathematics
Some results on graphs with exactly two main eigenvalues
An eigenvalue of a graph G is called main if there is an associated eigenvector not orthogonal to j, the vector with each entry equal to 1. In this work, an error in a prior paper [Y. Hou and F. Tian, Unicyclic graphs with exactly two main eigenvalues, Appl. Math. Letters, 19 (2006), 1143-1147] is pointed out and the properties of the graphs with exactly two main eigenvalues and with pendent vertices are discussed. As an application, we obtain, together with known results, all connected bicyclic and tricyclic graphs with exactly two main eigenvalues. © 2011 Elsevier Ltd. All rights reserved.
2-walk linear graphs, Bicyclic graphs, Main eigenvalues, Tricyclic graphs
Source Publication Title
Applied Mathematics Letters
Link to Publisher's Edition
Hou, Y., Tang, Z., & Shiu, W. (2012). Some results on graphs with exactly two main eigenvalues. Applied Mathematics Letters, 25 (10), 1274-1278. https://doi.org/10.1016/j.aml.2011.11.025