数学研究
數學研究
수학연구
JOURNAL OF MATHEMATICAL STUDY
2011年
2期
160-169
,共10页
谱半径%特征值%特征多项式%树
譜半徑%特徵值%特徵多項式%樹
보반경%특정치%특정다항식%수
Spectral radius%Eigenvalue%Characteristic polynomial%Tree
图的邻接矩阵的最大特征值称为图的谱半径.对于n≥8,1≤k≤n+2/3,本文确定了n个顶点和至少有k个顶点度不少于3的树中具有谱半径最大的树.
圖的鄰接矩陣的最大特徵值稱為圖的譜半徑.對于n≥8,1≤k≤n+2/3,本文確定瞭n箇頂點和至少有k箇頂點度不少于3的樹中具有譜半徑最大的樹.
도적린접구진적최대특정치칭위도적보반경.대우n≥8,1≤k≤n+2/3,본문학정료n개정점화지소유k개정점도불소우3적수중구유보반경최대적수.
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. We determine the trees with maximum spectral radius in class of trees on n vertices with at least k vertices of degree greater than two for 1 ≤ k ≤ n+2/3 and n ≥ 8.
