论文信息 - On graphs with at most three Laplacian eigenvalues greater than or equal to two - 字舞流文

On graphs with at most three Laplacian eigenvalues greater than or equal to two

All graphs with at most three Laplacian eigenvalues greater than or equal to two are determined. Besides, all minimal forbidden subgraphs with respect to this property are determined.

Miroslav Petrović | Bojana Borovićanin | Aleksandar Torgašev

[1] Guo Ji Ming,et al. A relation between the matching number and Laplacian spectrum of a graph , 2001 .

[2] Mirko Lepovic,et al. On bipartite graphs with small number of laplacian eigenvalues greater than two and three , 2000 .

[3] Yi-Zheng Fan,et al. On graphs with small number of Laplacian eigenvalues greater than two , 2003 .

[4] Ivan Gutman,et al. DEGENERACY IN THE EQUIVALENT BOND ORBITAL MODEL FOR HIGH-ENERGY BAND IN THE PHOTOELECTRON SPECTRA OF SATURATED HYDROCARBONS , 1998 .

[5] T. D. Morley,et al. Eigenvalues of the Laplacian of a graph , 1985 .

[6] Mirko Lepovic,et al. The high-energy band in the photoelectron spectrum of alkanes and its dependence on molecular structure , 1999 .

[7] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .

[8] Russell Merris. The number of eigenvalues greater than two in the Laplacian spectrum of a graph , 1991 .

[9] R. Merris. Laplacian matrices of graphs: a survey , 1994 .

[10] V. Sunder,et al. The Laplacian spectrum of a graph , 1990 .