论文信息 - On the index of cactuses with n vertices - 字舞流文

On the index of cactuses with n vertices

Among all connected cactuses with n vertices we find a unique graph whose largest eigenvalue (index, for short) is maximal.

Miroslav Petrović | Bojana Borovićanin

[1] Shu-Guang Guo,et al. The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices , 2005 .

[2] Feng Tian,et al. On the spectral radius of unicyclic graphs with perfect matchings , 2003 .

[4] L. Collatz,et al. Spektren endlicher grafen , 1957 .

[5] D. Cvetkovic,et al. Eigenspaces of graphs: Bibliography , 1997 .

[6] On the spectral radius of bicyclic graphs , 2005 .

[7] Baofeng Wu,et al. The spectral radius of trees on k pendant vertices , 2005 .

[8] An Chang. On the largest eigenvalue of a tree with perfect matchings , 2003, Discret. Math..

[9] Feng Tian,et al. On the index of bicyclic graphs with perfect matchings , 2004, Discret. Math..

[10] Slobodan K. Simić,et al. On the Largest Eigenvalue of Unicyclic Graphs , 1987 .

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

[12] L. Lovász,et al. On the eigenvalues of trees , 1973 .

[13] Xiao-Dong Zhang,et al. On the Spectral Radius of Graphs with Cut Vertices , 2001, J. Comb. Theory, Ser. B.

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