On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
From MaRDI portal
Publication:2235269
DOI10.1016/j.dam.2021.09.002zbMath1476.05113OpenAlexW3201442751MaRDI QIDQ2235269
Sergey Viktorovich Goryainov, Huiqiu Lin, Dandan Fan
Publication date: 21 October 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.09.002
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)
Related Items (5)
Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size ⋮ Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size ⋮ On the spectral radius of minimally 2-(edge)-connected graphs with given size ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Signless Laplacian spectral radius and fractional matchings in graphs
- On the spectral radius of trees with fixed diameter
- On the spectral radius of unicyclic graphs with fixed diameter
- On the spectral radius of trees with given independence number
- Maximizing the spectral radius of \(k\)-connected graphs with given diameter
- The signless Laplacian spectral radius of graphs with given degree sequences
- On the spectral radius of bipartite graphs with given diameter
- Maximizing the spectral radius of bicyclic graphs with fixed girth
- Eigenvalues and edge-connectivity of regular graphs
- A note on Laplacian graph eigenvalues
- The spectral radius of trees on \(k\) pendant vertices
- On the spectral radius of graphs with cut vertices
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- Connectivity and eigenvalues of graphs with given girth or clique number
- Graphs with maximal signless Laplacian spectral radius
- Spanning tree packing number and eigenvalues of graphs with given girth
- Spectral radius of bipartite graphs
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-disjoint spanning trees and eigenvalues
- Signless Laplacian eigenvalues and circumference of graphs
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
- The maximum spectral radius of wheel-free graphs
- SPECTRAL RADII OF UNICYCLIC GRAPHS WITH FIXED NUMBER OF CUT VERTICES
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- On the signless Laplacian spectral radius of unicyclic graphs with fixed matching number
- Minimally 2-connected graphs.
- On Minimal Blocks
- Maxima of the Q-index, Forbidden 4-ycle and 5-cycle
- On the spectral radius of trees
This page was built for publication: On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)