Volume 55, 2021Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|Page(s)||S2561 - S2574|
|Published online||02 March 2021|
Distance spectral radius of series-reduced trees with parameters
School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P.R. China
2 School of Mathematics, South China University of Technology, Guangzhou 510641, P.R. China
* Corresponding author: firstname.lastname@example.org
Accepted: 30 August 2020
For a connected graph G, the distance matrix is a real-symmetric matrix where the (u, v)-entry is the distance between vertex u and vertex v in G. The distance spectral radius of G is the largest eigenvalue of the distance matrix of G. A series-reduced tree is a tree with at least one internal vertex and all internal vertices having degree at least three. Those series-reduced trees that maximize the distance spectral radius are determined over all series-reduced trees with fixed order and maximum degree and over all series-reduced trees with fixed order and number of leaves, respectively.
Mathematics Subject Classification: 05C50 / 05C35 / 15A48
Key words: Distance spectral radius / distance matrix / maximum degree / number of leaves / series-reduced tree
© EDP Sciences, ROADEF, SMAI 2021
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.