Distance spectral radius of graphs with r pendent vertices

被引：38

作者：

Bose, Surya Sekhar ^{[1
]}

Nath, Milan ^{[1
]}

Paul, Somnath ^{[1
]}

机构：

[1] Tezpur Univ, Dept Math Sci, Tezpur 784028, India

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2011年 / 435卷 / 11期

关键词：

Distance matrix; Distance spectral radius; Pendent vertex; LARGEST EIGENVALUE; MATRIX; INDEXES;

D O I：

10.1016/j.laa.2011.04.041

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G(n)(r) be the class of all connected graphs of order n with r pendent vertices. In this paper, we determine the unique graph with minimal distance spectral radius in G(n)(r) . In addition, we determine the unique graph with maximal distance spectral radius in G(n)(r) for each r is an element of {2, 3, n - 3, n - 2, n - 1}. (C) 2011 Elsevier Inc. All rights reserved.

引用

页码：2828 / 2836

页数：9

共 20 条

[1] TOPOLOGICAL INDEXES AND REAL NUMBER VERTEX INVARIANTS BASED ON GRAPH EIGENVALUES OR EIGENVECTORS [J].