Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
From MaRDI portal
Publication:2158294
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
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- A note on Laplacian graph eigenvalues
- A note on Laplacian spectral radius of bipartite graphs with given connectivity
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
- Algebraic connectivity of \(k\)-connected graphs.
- An improved upper bound for Laplacian graph eigenvalues
- Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
- Eigenvalues of the Laplacian of a graph∗
- Graph theory
- Hamilton cycles and eigenvalues of graphs
- Inequalities for Graph Eigenvalues
- Laplacian matrices of graphs: A survey
- Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Minimally 2-connected graphs.
- Old and new results on algebraic connectivity of graphs
- On Minimal Blocks
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- On the Laplacian spectral radius of bipartite graphs with fixed order and size
- On the maximal index of graphs with a prescribed number of edges
- On the spectral radius of (0,1)-matrices
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- The Laplacian Spectrum of a Graph II
- The Laplacian spectral radius of a graph under perturbation
- The Laplacian spectral radius of some graphs
- The minimal Laplacian spectral radius of trees with diameter 4
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
Cited in
(10)- 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
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- Connectivity and spectral radius of graphs.
- Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
- Sharp upper bounds on the \(Q\)-index of (minimally) 2-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 (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- 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)
