GRAPH TRANSFORMATION AND DISTANCE SPECTRAL RADIUS

被引：0

作者：

Nath, Milan ^{[1
]}

Paul, Somnath ^{[1
]}

机构：

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

来源：

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2013年 / 5卷 / 03期

关键词：

Distance matrix; distance spectral radius; corona tree;

D O I：

10.1142/S1793830913500146

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Trees are very common in the theory and applications of combinatorics. In this paper, we consider graphs whose underlying structure is a tree and study the behavior of the distance spectral radius under a graph transformation. As an application, we find the corona tree that maximizes the distance spectral radius among all corona trees with a fixed maximum degree. We also find the graph with minimal (maximal) distance spectral radius among all corona trees. Finally, we determine the graph with minimal distance spectral radius in a special class of corona trees.

引用

页数：10

共 17 条

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