几类极图谱半径序列的极限  

Limitation of the Spectral Radius of Several Kinds of Limited Graphs

作　　者：田路路[1] 宋海洲[1] 汪秋分[1] 

机构地区：[1]华侨大学数学科学学院,福建泉州362021

出　　处：《华侨大学学报（自然科学版）》2013年第1期100-105,共6页Journal of Huaqiao University(Natural Science)

基　　金：华侨大学科研基金资助项目(10HZR26)

摘　　要：讨论几类极图谱半径序列的极限问题,给出n个顶点的路Pn和回路Cn的拉普拉斯谱半径在n递增时的极限,以及在最大度为Δ的n个顶点的树中、邻接谱半径最小的树和邻接谱半径最大的树的邻接谱半径在Δ固定n递增时的极限.In this paper,we discuss the problem of the limitation of the spectral radius sequence of several kinds of limited graphs,and give the limitations of the Laplacian spectral radius of the path and the loop on n vertices when the number of n increasing,as well as the limitations of the adjacency spectral radii for the trees whose adjacency spectral radii are the smallest and the biggest in the trees on n vertices and maximum degree when Δ is fixed and the number of n increasing.

关 键 词：图 几乎完全满度树 完全满度树 谱半径 极限 

分 类 号：O157.5[理学—数学]