Spectral radius and k-connectedness of a graph
From MaRDI portal
Publication:1744085
DOI10.1007/S00605-017-1055-9zbMATH Open1391.05164OpenAlexW2606028403MaRDI QIDQ1744085FDOQ1744085
Authors: Lihua Feng, Peng-Li Zhang, Weijun Liu 
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
Recommendations
- On the spectral radius of graphs with connectivity at most \(k\)
- scientific article; zbMATH DE number 3972892
- Bounds of the spectral radius of connected graphs
- Bounds of the spectral radius of connected graphs
- On the Aα-spectral radius of connected graphs
- On the spectral radius of graphs
- Spectral radius of strongly connected digraphs
- Connectivity and spectral radius of graphs.
- Connectivity and minimal distance spectral radius of graphs
- The Laplacian spectral radius of graphs with given connectivity.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- A sharp upper bound of the spectral radius of graphs
- On Hamilton's ideals
- Some Inequalities for the Largest Eigenvalue of a Graph
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Spectral radius and Hamiltonian properties of graphs
- Title not available (Why is that?)
- Spectral radius and Hamiltonicity of graphs
- The spectral radius of graphs without paths and cycles of specified length
- Title not available (Why is that?)
- Matchings in regular graphs from eigenvalues
- On the spectral radius of graphs with cut vertices
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
- A method in graph theory
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Best monotone degree conditions for graph properties: a survey
- On the spectral radius of graphs with a given domination number
- Perfect matchings, eigenvalues and expansion
- Large matchings from eigenvalues
- Eigenvalues and edge-connectivity of regular graphs
- Spectral radius of graphs
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Spectral conditions for some graphical properties
- Spectral radius and traceability of connected claw-free graphs
- The spectral radius of edge chromatic critical graphs
- Minimum cuts, girth and a spectral threshold
Cited In (21)
- Eigenvalues and triangles in graphs
- Connected hypergraphs with small spectral radius
- The \(Q\)-index and connectivity of graphs
- Spectral bisection of graphs and connectedness
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- Connectivity and spectral radius of graphs.
- A note on extremal trees with degree conditions
- Integral Cayley graphs over a certain nonabelian group
- The maximum spectral radius of graphs without friendship subgraphs
- Radius of \((2k-1)\)-connected graphs
- Integral Cayley graphs over dicyclic group
- Extremal problems on the Hamiltonicity of claw-free graphs
- Title not available (Why is that?)
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
- Integral Cayley graphs over semi-dihedral groups
- New sufficient spectral conditions on \(k\)-edge-connected graph
- Maximum spectral radius of graphs with connectivity at most \(k\) and minimum degree at least \(\delta\)
- Connectivity, diameter, independence number and the distance spectral radius of graphs
- Some sufficient conditions on \(k\)-connected graphs
This page was built for publication: Spectral radius and \(k\)-connectedness of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744085)
