Extremal spectral radius and essential edge-connectivity
From MaRDI portal
Publication:6494930
DOI10.1016/J.DISC.2024.113948MaRDI QIDQ6494930
Huiqiu Lin, Unnamed Author, Yingzhi Tian
Publication date: 30 April 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Mathematical programming (90Cxx) Basic linear algebra (15Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- The maximum Perron roots of digraphs with some given parameters
- Distance spectral radius of digraphs with given connectivity
- Spanning trails in essentially 4-edge-connected graphs
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- Minimum cuts, girth and a spectral threshold
- Eigenvalues and edge-connectivity of regular graphs
- On computing a conditional edge-connectivity of a graph
- Packing spanning trees in highly essentially connected graphs
- Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius of graphs with cut vertices
- On the spectral radius of graphs with cut edges
- Spanning tree packing and 2-essential edge-connectivity
- On essentially 4-edge-connected cubic bricks
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- Connected even factors in the square of essentially 2-edge-connected graph
- Sharp spectral bounds for the edge-connectivity of regular graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Matrix Analysis
This page was built for publication: Extremal spectral radius and essential edge-connectivity
