Volume 55, Number 3, May-June 2021
|Page(s)||1757 - 1765|
|Published online||22 June 2021|
On graft transformations decreasing distance spectral radius of graphs
Basic Courses Department, Guangdong Communication Polytechnic, Guangzhou 510650, P.R. China
2 School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P.R. China
* Corresponding author: email@example.com
Accepted: 27 May 2021
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. In this paper, we give several less restricted graft transformations that decrease the distance spectral radius, and determine the unique graph with minimum distance spectral radius among home-omorphically irreducible unicylic graphs on n ≥ 6 vertices, and the unique tree with minimum distance spectral radius among trees on n vertices with given number of vertices of degree two, respectively.
Mathematics Subject Classification: 05C50 / 15A48
Key words: Distance spectral radius / distance matrix / graft transformation / homeomorphically irreducible unicylic graph
© The authors. Published by EDP Sciences, ROADEF, SMAI 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.