On the maximal distance spectral radius of graphs without a pendent vertex

DOI10.1016/J.LAA.2013.01.019zbMath1282.05096OpenAlexW2044111071MaRDI QIDQ389706

Surya Sekhar Bose, Milan Nath, Somnath Paul

Publication date: 21 January 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.01.019

zbMATH Keywords

distance matrixcactus\(\infty(p\(\theta(plq)\)-graphSaw-grapht

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (13)

On the distance spread of cacti and bicyclic graphs ⋮ The eccentricity spread of weak-friendship graphs ⋮ The distance spectrum of the complements of graphs of diameter greater than three ⋮ The distance spectrum of the complements of graphs with two pendent vertices ⋮ On the distance and distance signless Laplacian spectral radii of bicyclic graphs ⋮ Unnamed Item ⋮ On the distance and distance signless Laplacian spectral radii of tricyclic graphs ⋮ The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs ⋮ Distance spectra of graphs: a survey ⋮ Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph ⋮ Maximal distance spectral radius of 4-chromatic planar graphs ⋮ On the distance spectral radius of trees with given degree sequence ⋮ On the distance Laplacian spectral radius of bipartite graphs

Cites Work

• Some graft transformations and its applications on the distance spectral radius of a graph
• On the distance spectral radius of cacti
• Distance spectral radius of graphs with \(r\) pendent vertices
• Some graft transformations and its application on a distance spectrum
• On the distance spectral radius of trees
• Connectivity and minimal distance spectral radius of graphs
• The distance spectrum of a tree
• Distance spectral radius of trees with fixed maximum degree

This page was built for publication: On the maximal distance spectral radius of graphs without a pendent vertex