Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
From MaRDI portal
Publication:2227978
Abstract: There have been researches on sufficient spectral conditions for Hamiltonian properties and path-coverable properties of graphs. Utilizing the Bondy-Chv'atal closure, we provide a unified approach to study sufficient graph eigenvalue conditions for these properties and sharpen former spectral results in [{em Linear Algebra Appl.}, 432 (2010), 566-570], [{em Linear Algebra Appl.}, 432 (2010), 2170-2173], [{em Appl. Mech. Mater.}, 336-338 (2013), 2329-2334], [{em Linear Algebra Appl.}, 467 (2015), 254-266], [{em Linear Multilinear Algebra}, 64 (2016), 2252-2269], and [{em J. Comb. Optim.}, 35 (2018), 1104-1127], among others.
Recommendations
- Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
- scientific article; zbMATH DE number 6401583
- Spectral radius and Hamiltonian properties of graphs. II
- Spectral radius of a balanced bipartite graph and its Hamiltonicity
- Energy and Hamiltonicity of graphs
Cites work
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- scientific article; zbMATH DE number 6119656 (Why is no real title available?)
- A method in graph theory
- Bounds of eigenvalues of a nontrivial bipartite graph.
- Closure concepts: A survey
- Graph theory
- On a conjecture of V. Nikiforov
- Signless Laplacian spectral radius and Hamiltonicity
- Signless Laplacians of finite graphs
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Spectral conditions of complement for some graphical properties
- Spectral radius and Hamiltonian graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral results on Hamiltonian problem
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- The number of edges, spectral radius and Hamilton-connectedness of graphs
Cited in
(3)
This page was built for publication: Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227978)