Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
From MaRDI portal
Publication:5375918
Abstract: In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to determine the Hamiltonicity of graphs.
Recommendations
- Signless Laplacian Spectral Radius and Some Hamiltonian Properties of Graphs
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
- On the signless Laplacian spectral radius of some graphs
- A note on signless Laplacian spectral condition of Hamiltonian graphs
- Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
- The signless Laplacian spectral radius of graphs with given degree sequences
- The signless Laplacian spectral radius of graphs with given diameter
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 6793075 (Why is no real title available?)
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Reducibility among combinatorial problems
- Signless Laplacian spectral radius and Hamiltonicity
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Some Theorems on Abstract Graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
Cited in
(17)- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Spectral radius and Hamiltonicity of graphs
- The \(Q\)-index and connectivity of graphs
- Signless Laplacian spectral radius and Hamiltonicity
- Spectral radius of a balanced bipartite graph and its Hamiltonicity
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Laplacian spectral radius and some Hamiltonian properties of graphs
- Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
- Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
- A note on signless Laplacian spectral condition of Hamiltonian graphs
- Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
- On sufficient spectral radius conditions for Hamiltonicity
This page was built for publication: Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375918)