Some graft transformations and its applications on the distance spectral radius of a graph

DOI10.1016/j.aml.2011.09.007zbMath1243.05157OpenAlexW1984015993MaRDI QIDQ427598

Guanglong Yu, Hailiang Zhang, Hui-cai Jia, Jin-Long Shu

Publication date: 14 June 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.09.007

zbMATH Keywords

distance spectral radiusgraft transformationpendant number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (19)

On the maximal distance spectral radius of graphs without a pendent vertex ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ On distance spectral radius of graphs ⋮ Distance spectral radius of trees with fixed number of pendent vertices ⋮ On distance spectral radius of graphs with given number of pendant paths of fixed length ⋮ On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs ⋮ On the distance spectral radius of cacti ⋮ Extremal cacti of given matching number with respect to the distance spectral radius ⋮ Maximal distance spectral radius of trees ⋮ The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs ⋮ The effect of a graft transformation on distance spectral radius ⋮ Distance spectra of graphs: a survey ⋮ Maximal distance spectral radius of 4-chromatic planar graphs ⋮ Distance spectral radius of uniform hypergraphs ⋮ On the distance \(\alpha \)-spectral radius of a connected graph ⋮ On the distance spectral radius of trees ⋮ Further results on the distance spectral radius of graphs ⋮ On the distance Laplacian spectral radius of bipartite graphs ⋮ Ordering trees by their distance spectral radii

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Distance spectral radius of trees with given matching number
• Some graft transformations and its application on a distance spectrum
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• The spectral radius of trees on \(k\) pendant vertices
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Distance spectral radius of trees with fixed maximum degree
• New Bounds on the Complexity of the Shortest Path Problem
• On the Addressing Problem for Loop Switching

This page was built for publication: Some graft transformations and its applications on the distance spectral radius of a graph