论文信息 - On generalized theta-graphs whose second largest eigenvalue does not exceed 1

On generalized theta-graphs whose second largest eigenvalue does not exceed 1

A generalized @q-graph, denoted by @q"n, is a graph consisting of n internal disjoint (u, v)-paths, where [email protected]?n<~. In this paper, all generalized @q-graphs whose second largest eigenvalues do not exceed 1 have been determined.

Qiongxiang Huang | Mingfei Gao

[1] J. Ivančo. On graphs with exactly one eigenvalue less than—1 , 1991 .

[2] Guang-Hui Xu. On unicyclic graphs whose second largest eigenvalue dose not exceed 1 , 2004, Discret. Appl. Math..

[3] D. Cvetkovic,et al. The largest eigenvalue of a graph: A survey , 1990 .

[4] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[5] Shu-Guang Guo. On bicyclic graphs whose second largest eigenvalue does not exceed 1 , 2005 .

[6] A. Neumaier. The second largest eigenvalue of a tree , 1982 .

[7] Michael Doob,et al. Spectra of graphs , 1980 .