Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
From MaRDI portal
Publication:2158294
DOI10.1016/J.LAA.2022.06.027zbMATH Open1493.05202OpenAlexW4284699722WikidataQ114151346 ScholiaQ114151346MaRDI QIDQ2158294FDOQ2158294
Authors: Rong Zhang, Shu-Guang Guo
Publication date: 26 July 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2022.06.027
Recommendations
- Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
- Maximizing the Laplacian spectral radii of graphs with given diameter
- Maximizing the spectral radius of \(k\)-connected graphs with given diameter
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- 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\)
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
- Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter
Cites Work
- Graph theory
- A note on Laplacian graph eigenvalues
- Hamilton cycles and eigenvalues of graphs
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
- On the spectral radius of (0,1)-matrices
- Laplacian matrices of graphs: A survey
- The Laplacian spectral radius of some graphs
- Title not available (Why is that?)
- An improved upper bound for Laplacian graph eigenvalues
- Minimally 2-connected graphs.
- On Minimal Blocks
- Old and new results on algebraic connectivity of graphs
- On the maximal index of graphs with a prescribed number of edges
- The minimal Laplacian spectral radius of trees with diameter 4
- The Laplacian spectral radius of a graph under perturbation
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- On the Laplacian spectral radius of bipartite graphs with fixed order and size
- Algebraic connectivity of k-connected graphs
- Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
- Inequalities for Graph Eigenvalues
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
- Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- Title not available (Why is that?)
Cited In (5)
- On the \(\alpha\)-index of minimally 2-connected graphs with given order or size
- Maxima of the Q ( L )-index of (minimally) 2-edge-connected graphs with given size
- Maxima of the \(A_\alpha\)-spectral radius of graphs with given size and minimum degree \(\delta \ge 2\)
- Maximizing the spectral radius of \(k\)-connected graphs with given diameter
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
This page was built for publication: Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158294)