Spectral radius and \(k\)-connectedness of a graph
From MaRDI portal
Publication:1744085
DOI10.1007/s00605-017-1055-9zbMath1391.05164OpenAlexW2606028403MaRDI QIDQ1744085
Wei-jun Liu, Peng-Li Zhang, Li-Hua Feng
Publication date: 16 April 2018
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-017-1055-9
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)
Related Items (9)
Integral Cayley graphs over a certain nonabelian group ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ Integral Cayley graphs over semi-dihedral groups ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Integral Cayley graphs over dicyclic group ⋮ A note on extremal trees with degree conditions ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree ⋮ Eigenvalues and triangles in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Best monotone degree conditions for graph properties: a survey
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Spectral conditions for some graphical properties
- Large matchings from eigenvalues
- The spectral radius of graphs without paths and cycles of specified length
- Matchings in regular graphs from eigenvalues
- Minimum cuts, girth and a spectral threshold
- Eigenvalues and edge-connectivity of regular graphs
- A method in graph theory
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius of graphs with cut vertices
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- On the spectral radius of graphs with a given domination number
- On Hamilton's ideals
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and traceability of connected claw-free graphs
- Spectral radius and Hamiltonicity of graphs
- The spectral radius of edge chromatic critical graphs
This page was built for publication: Spectral radius and \(k\)-connectedness of a graph