Spectral conditions for graphs to be k-Hamiltonian or k-path-coverable
From MaRDI portal
Publication:2282471
Recommendations
- Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
- scientific article; zbMATH DE number 6401583
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- Spectral condition for Hamiltonicity of a graph
- scientific article; zbMATH DE number 6793075
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Sufficient conditions for a graph to be k-edge-Hamiltonian, k-path-coverable, traceable and Hamilton-connected
- Sufficient conditions for some Hamiltonian properties and k-connectivity of graphs
Cites work
- A method in graph theory
- A sharp upper bound of the spectral radius of graphs
- Best monotone degree conditions for graph properties: a survey
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Extremal cacti of given matching number with respect to the distance spectral radius
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- n-Hamiltonian graphs
- On a conjecture about tricyclic graphs with maximal energy
- On bags and bugs
- On Hamilton's ideals
- On minimal energies of trees with given diameter
- On n-Hamiltonian graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the spectral radius of graphs with a given domination number
- On tricyclic graphs of a given diameter with minimal energy
- Partitioning a graph into vertex-disjoint paths
- Signless Laplacian spectral radius and Hamiltonicity
- Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
- Some Inequalities for the Largest Eigenvalue of a Graph
- Some sufficient conditions on \(k\)-connected graphs
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Spectral conditions for some graphical properties
- Spectral radius and \(k\)-connectedness 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.
- Spectral radius and traceability of connected claw-free graphs
- Spectral radius of graphs
- Spectral radius of graphs with given matching number
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- The signless Laplacian spectral radius of bounded degree graphs on surfaces
- The spectral radius of edge chromatic critical graphs
- The spectral radius of graphs without paths and cycles of specified length
- Wiener index, Harary index and graph properties
- Wiener-type invariants on graph properties
Cited in
(5)- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- New sufficient conditions on k-path-coverable graphs
- Some sufficient conditions for graphs being k-leaf-connected
- Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
- The \(Q\)-index and connectivity of graphs
This page was built for publication: Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282471)
