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 QIDQ2870035FDOQ2870035

Authors: 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

Recommendations

• On the spectral radius of graphs with connectivity at most \(k\)
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
• Spectral radius and \(k\)-connectedness of a graph
• Maximizing the spectral radius of \(k\)-connected graphs with given diameter

zbMATH Keywords

spectral radiusconnectivity

Mathematics Subject Classification ID

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

Cited In (10)

• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• Title not available (Why is that?)
• Two spectral extremal results for graphs with given order and rank
• A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
• On the spectral radius of graphs with connectivity at most \(k\)
• Maximizing the spectral radius of \(k\)-connected graphs with given diameter
• On the minimum spectral radius of connected graphs of given order and size
• Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
• Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
• 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 \(\delta\)

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