Bounds of spectral radii of K_{2,3}-minor free graphs
Bounds of spectral radii of K_{2,3}-minor free graphs
复制标题
DOI：
10.13001/1081-3810.1513
复制
发表时间：
2012
影响因子：
0.7
通讯作者：
Guanglong Yu;Jinlong Shu;Yuan Hong
中科院分区：
文献类型：
--
作者：
Guanglong Yu;Jinlong Shu;Yuan Hong
设A（G）是图G的邻接矩阵。A（G）的最大特征值称为G的谱半径。本文证明了阶为n的无K2，3-子图的谱半径的一个上界为3 + rn 7。为了证明这个上界，本文给出了K2，3-子自由图的一个结构刻画。
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 K2,3-minor free graphs with order n is shown to be 3 + r n 7 . In order to prove this upper bound, a structural characterization of K2,3-minor free graphs is presented in this paper.