Minimum distance spectral radius of graphs with given edge connectivity

zbMATH Open1313.05235arXiv1203.3112MaRDI QIDQ5497585FDOQ5497585

Authors: Xiaoxin Li, Yizheng Fan, Yi Wang 

Publication date: 11 February 2015

Abstract: In this paper we determine the unique graph with minimum distance spectral radius among all connected graphs of fixed order and given edge connectivity.

Full work available at URL: https://arxiv.org/abs/1203.3112

Recommendations

• Connectivity, diameter, independence number and the distance spectral radius of graphs
• A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS
• Connectivity and minimal distance spectral radius of graphs
• On the distance Laplacian spectral radius of graphs
• On minimally 2-(edge)-connected graphs with extremal spectral radius

zbMATH Keywords

spectral radiusdistance matrixedge connectivity

Mathematics Subject Classification ID

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

Cited In (8)

• Two spectral extremal results for graphs with given order and rank
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• Distance spectra of graphs: a survey
• On the minimum spectral radius of connected graphs of given order and size
• Connectivity and minimal distance spectral radius of graphs
• Extremal spectral radius and essential edge-connectivity
• On the spectral radius of minimally 2-(edge)-connected graphs with given size
• The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity

This page was built for publication: Minimum distance spectral radius of graphs with given edge connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5497585)