Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
From MaRDI portal
Publication:6069165
DOI10.1016/j.dam.2023.08.013zbMath1526.05079MaRDI QIDQ6069165
Publication date: 13 November 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Sharp bounds on the signless Laplacian spectral radii of graphs
- On the spectral radius of (0,1)-matrices
- On the maximal index of graphs with a prescribed number of edges
- A note on Laplacian graph eigenvalues
- The Laplacian spectrum of a graph
- The \(A_\alpha\)-spectral radius of graphs with a prescribed number of edges for \(\frac{1}{2}\leq\alpha\leq 1\)
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Ordering graphs with given size by their signless Laplacian spectral radii
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- On the \(A_\alpha\)- spectral radius of Halin graphs
- On the \(A_\alpha \)-spectral radius of graphs with given size and diameter
- Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter
- Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
- Ordering the maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- Cliques and the spectral radius
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
- Some new results in extremal graph theory
- Eigenvalue bounds for the signless laplacian
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Eigenvalues and triangles in graphs
- Inequalities for Graph Eigenvalues
- Minimally 2-connected graphs.
- An extremal problem on Q-spectral radii of graphs with given size and matching number
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
This page was built for publication: Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size