节点文献
图的Laplacian谱半径的界
Bounds on the Laplacian Spectral Radius of Graphs
【摘要】 设G为n阶简单连通图,V(G)为G的顶点集,E(G)为G的边集,du表示顶点u的度,Tu表示顶点u的2-度,μ(G)表示图G的Laplician谱半径。该文证明了μ(G)≤max{d2u+d2v+Tu+Tv|uv∈E(G)}.特别,若G为偶图,则min{d2u+d2v+Tu+Tv|uv∈E(G)}≤μ(G)≤max{d2u+d2v+Tu+Tv|uv∈E(G)}.
【Abstract】 Let G be a simple connected graph with n vertices. Let du and Tu denote the degree and 2-degree of the vertex u, respectively, μ(G) denote the Laplacian spectral radius of G. In this paper, we proveμ(G)≤max{d2u+d2v+Tu+Tv|uv∈E(G)}.Moreover, if G is a bipartite graph, thenmin{d2u+d2v+Tu+Tv|uv∈E(G)}≤μ(G)≤max{d2u+d2v+Tu+Tv|uv∈E(G)},where if G is a semiregular graph, the equality holds.
【关键词】 邻接谱半径;
Laplacian谱半径;
线图;
2-度;
【Key words】 adjacency spectral radius; Laplacian spectral radius; line graph; 2-degree;
【Key words】 adjacency spectral radius; Laplacian spectral radius; line graph; 2-degree;
【基金】 国家自然科学基金(19971027);上海市重点学科建设项目
- 【文献出处】 华东师范大学学报(自然科学版) ,Journal of Eastchina Normal University(Natural Science) , 编辑部邮箱 ,2002年04期
- 【分类号】O157.5
- 【被引频次】2
- 【下载频次】90