摘要
设(n,m)表示具有n个顶点m条边的有限简单连通图,ρ(G)是G的最大特征值,也称为G的谱半径。若G∈(n,m),m≥n+1,且ρ(G)=min{ρ(H):H∈(n,m)},则G一定不含悬挂边。
Let (n,m) be the simple connected graphes with n vertices and m edges, ρ(G) denotes the largest eigenvalue of the graph G . The following result is obtained.If G ∈ ( n,m),m≥n+1 and ρ(G)= min {ρ(H):H∈ (n,m)}, then G does not contain pendant edge.
出处
《石油大学学报(自然科学版)》
CSCD
1998年第2期85-85,88,共2页
Journal of the University of Petroleum,China(Edition of Natural Science)
关键词
谱半径
特征多项式
图
spectral radius
characteristic polynomial
graph