Sufficient spectral radius conditions for Hamilton-connectivity of k-connected graphs
From MaRDI portal
Publication:2053709
Recommendations
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
- Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
- Sufficient conditions for some Hamiltonian properties and \(k\)-connectivity of graphs
- Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
- Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
- scientific article; zbMATH DE number 6793075
- scientific article; zbMATH DE number 6401583
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and Hamiltonicity of graphs
Cites work
- A method in graph theory
- A sharp upper bound of the spectral radius of graphs
- Advances on the Hamiltonian problem -- a survey
- Chromatic number and the 2-rank of a graph
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Graph theory
- On Hamilton's ideals
- On a conjecture of V. Nikiforov
- On graphs with randomly deleted edges
- Recent advances on the Hamiltonian problem: survey III
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Some Inequalities for the Largest Eigenvalue of a Graph
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Spectra of graphs
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Spectral condition for Hamiltonicity of a graph
- Spectral radius and Hamiltonian graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
- Sufficient spectral conditions on Hamiltonian and traceable graphs
Cited in
(15)- Spectral analogues of Erdős' theorem on Hamilton-connected graphs
- Connectivity and spectral radius of graphs.
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
- Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
- Some sufficient conditions on \(k\)-connected graphs
- Some sufficient conditions for graphs to be \(k\)-leaf-connected
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- On sufficient spectral radius conditions for Hamiltonicity
- Sufficient conditions for some Hamiltonian properties and \(k\)-connectivity of graphs
- An improvement of spectral conditions for Hamilton-connected graphs
- scientific article; zbMATH DE number 6831911 (Why is no real title available?)
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
This page was built for publication: Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053709)
