1. Some graft transformations and its applications on the distance spectral radius of a graph
- Author
-
Yu, Guanglong, Jia, Huicai, Zhang, Hailiang, and Shu, Jinlong
- Subjects
- *
MATHEMATICAL transformations , *SPECTRAL theory , *RADIUS (Geometry) , *GRAPH theory , *EIGENVALUES , *MATRICES (Mathematics) - Abstract
Abstract: Let denote the distance matrix of a connected graph with order , where is equal to the distance between and in . The largest eigenvalue of is called the distance spectral radius of graph , denoted by . In this paper, some graft transformations that decrease or increase are given. With them, for the graphs with both order and pendant vertices, the extremal graphs with the minimum distance spectral radius are completely characterized; the extremal graph with the maximum distance spectral radius is shown to be a dumbbell graph (obtained by attaching some pendant edges to each pendant vertex of a path respectively) when ; for , the extremal graphs with the maximum distance spectral radius are completely characterized. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF