Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
From MaRDI portal
Publication:2166257
DOI10.1016/j.dam.2022.06.013zbMath1496.05090OpenAlexW4283522158WikidataQ113877187 ScholiaQ113877187MaRDI QIDQ2166257
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.06.013
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)
Related Items (5)
Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\) ⋮ On the \(\alpha\)-index of minimally 2-connected graphs with given order or size ⋮ Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size ⋮ Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index ⋮ Maxima of the \(A_\alpha\)-index of graphs with given size and domination number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for the clique and the chromatic numbers of a graph
- Walks and the spectral radius of graphs
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- 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
- 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
- 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\)
- Three conjectures in extremal spectral graph theory
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Cliques and the spectral radius
- Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
- Some new results in extremal graph theory
- Some Inequalities for the Largest Eigenvalue of a Graph
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Eigenvalues and triangles in graphs
- Inequalities for Graph Eigenvalues
- Minimally 2-connected graphs.
- On Minimal Blocks
- Maxima of the Q-index, Forbidden 4-ycle and 5-cycle
This page was built for publication: Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
