Maximizing the spectral radius of \(k\)-connected graphs with given diameter

DOI10.1016/j.laa.2015.09.057zbMath1326.05083OpenAlexW2220427882MaRDI QIDQ896859

Wai Chee Shiu, Pak Kiu Sun, Peng Huang

Publication date: 14 December 2015

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

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

zbMATH Keywords

spectral radiusdiameteradjacency matrix\(k\)-connected graphs

Mathematics Subject Classification ID

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

Related Items (8)

Connectivity, diameter, independence number and the distance spectral radius of graphs ⋮ Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter ⋮ Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter ⋮ Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs ⋮ On spectral radius of graphs with pendant paths ⋮ Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Graphs with given diameter maximizing the spectral radius
• On bags and bugs
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• On some interconnections between combinatorial optimization and extremal graph theory
• Diameters in graphs

This page was built for publication: Maximizing the spectral radius of \(k\)-connected graphs with given diameter