Spectral condition for Hamiltonicity of a graph

DOI10.1016/J.LAA.2016.01.005MaRDI QIDQ252603zbMATHOpenAlexFDO

Authors V. I. Benediktovich

Publication date 3 March 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2016.01.005

zbMATH Keywords

Hamiltonian cycleHamiltonian pathminimum degreespectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45)

Cites work

• A domain monotonicity theorem for graphs and Hamiltonicity
• A sharp upper bound of the spectral radius of graphs
• Chromatic number and the 2-rank of a graph
• Hamilton cycles and eigenvalues of graphs
• More spectral bounds on the clique and independence numbers
• On Hamilton's ideals
• On a conjecture of V. Nikiforov
• On graphs with randomly deleted edges
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• On the spectral radii of graphs without given cycles
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Signless Laplacian spectral radius and Hamiltonicity
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Some Inequalities for the Largest Eigenvalue of a Graph
• Sparse pseudo‐random graphs are Hamiltonian
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral radius and Hamiltonian graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• The spectral radius of graphs without paths and cycles of specified length

Cited in

(21)

• An improvement of spectral conditions for Hamilton-connected graphs
• The number of edges, spectral radius and Hamilton-connectedness of graphs
• Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
• Toughness, Hamiltonicity and spectral radius in graphs
• Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
• Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
• On the normalized Laplacian spectral radius of traceable graphs
• Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
• Spectral radius and Hamiltonicity of graphs with large minimum degree.
• Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
• On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
• The spectral radius and \(k\)-power of Hamilton cycle of graphs
• scientific article; zbMATH DE number 6401583 (Why is no real title available?)
• Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
• The largest eigenvalue conditions for Hamiltonian and traceable graphs
• scientific article; zbMATH DE number 6949373 (Why is no real title available?)
• On sufficient spectral radius conditions for Hamiltonicity
• Spectral and extremal conditions for supereulerian graphs
• Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs

This page was built for publication: Spectral condition for Hamiltonicity of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q252603)