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

DOI10.1016/J.LAA.2015.09.057zbMATH Open1326.05083OpenAlexW2220427882MaRDI QIDQ896859FDOQ896859

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

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

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)

Cites Work

• Graph theory
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Spectra of graphs
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Diameters in graphs
• On bags and bugs
• Graphs with given diameter maximizing the spectral radius
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• On some interconnections between combinatorial optimization and extremal graph theory

Cited In (20)

• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• The maximum principal ratio of graphs
• Maximal graphs and graphs with maximal spectral radius
• Title not available (Why is that?)
• Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
• On the spectral radius of graphs with connectivity at most \(k\)
• On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
• The maximum spectral radius of graphs of given size with forbidden subgraph
• On the non-backtracking spectral radius of graphs
• THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS
• Spectral radius of graph with given diameter.
• Maximum spectral radius of graphs with connectivity at most \(k\) and minimum degree at least \(\delta\)
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius
• 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
• Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
• Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs
• Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter

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)