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

DOI10.1016/J.LAA.2015.09.057MaRDI QIDQ896859zbMATH OpenOpenAlexFDO

Authors Peng Huang, Wai Chee Shiu, Pak Kiu Sun

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 radiusadjacency matrixdiameter\(k\)-connected graphs

Mathematics Subject Classification ID

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

Recommendations

• Graphs with given diameter maximizing the spectral radius
• Maximizing the Laplacian spectral radii of graphs with given diameter
• Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter
• Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
• Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
• Maximum spectral radius of graphs with connectivity at most \(k\) and minimum degree at least \(\delta\)
• On the spectral radius of graphs with connectivity at most \(k\)
• Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• Maximal graphs and graphs with maximal spectral radius

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• An introduction to the theory of graph spectra
• Diameters in graphs
• Graph theory
• Graphs with given diameter maximizing the spectral radius
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• On bags and bugs
• On some interconnections between combinatorial optimization and extremal graph theory
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Spectra of graphs

Cited in

(20)

• THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS
• Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
• On the non-backtracking spectral radius of graphs
• On spectral radius of graphs with pendant paths
• Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter
• Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
• Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
• Spectral radius of graph with given diameter.
• On the spectral radius of graphs with connectivity at most \(k\)
• Maximum spectral radius of graphs with connectivity at most \(k\) and minimum degree at least \(\delta\)
• The maximum spectral radius of graphs of given size with forbidden subgraph
• The maximum principal ratio of graphs
• Maximal graphs and graphs with maximal spectral radius
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
• Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius
• On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
• scientific article; zbMATH DE number 3972892 (Why is no real title available?)
• Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs

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

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