BOUNDS OF SPECTRAL RADII OF K-2,K-3-MINOR FREE GRAPHS

作者：Yu, Guanglong^*; Shu, Jinlong; Hong, Yuan

来源：Electronic Journal of Linear Algebra, 2012, 23: 171-179.

DOI：10.13001/1081-3810.1513

• Bound
• Spectral radius
• Minor free

Let A(G) be the adjacency matrix of a graph G. The largest eigenvalue of A(G) is called spectral radius of G. In this paper, an upper bound of spectral radii of K-2,K-3-minor free graphs with order n is shown to be 3/2 root n - 7/4. In order to prove this upper bound, a structural characterization of K-2,K-3-minor free graphs is presented in this paper.

• 出版日期2012-2
• 单位华东师范大学