摘要
一个连通图G的距离无符号拉普拉斯谱半径是G的距离无符号拉普拉斯矩阵的谱半径.G的距离无符号拉普拉斯矩阵定义为Q(G)=Tr(G)+D(G),这里Tr(G)是G的顶点传递的对角阵,且D(G)是G的距离矩阵.研究了所有n阶具有n-3个悬挂点的树的距离无符号拉普拉斯谱半径的极小值,并刻画了一类n阶具有n-3个悬挂点的树的距离无符号拉普拉斯谱半径的极大值与极小值.
The distance signless Laplacian spectral radius of a connected graph G is the spectral radius of the distance signless Laplacian matrix of G, defined as L（G） = Tr（G）4-D（G）, where Tr（G） is the diagonal matrix of vertex transmissions of G, and D（G） is the distance matrix of G.It was investigated that the minimum of the distance signless Laplacian spectral radius among all trees with n-3 pendent vertices, and characterized that the unique tree whose distance signless Laplacian spectral radius is the maximum （minimum） among some trees with n-3 pendent vertices.
基金
Supported by National Natural Science Foundation of China(11071002)
NFS of Anhui Province(11040606M14)
NSF of Department of Education of Anhui Province(KJ2011A195,KJ2010B136)
