Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ

DOI10.1007/978-3-642-45278-9_25zbMATH Open1408.05081OpenAlexW2227323548MaRDI QIDQ2870035

Hongliang Lu, Yuqing Lin

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_25

zbMATH Keywords

spectral radiusconnectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (3)

Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree ⋮ Title not available (Why is that?)

This page was built for publication: Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ

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