Hamilton cycles and eigenvalues of graphs

DOI10.1016/0024-3795(95)00254-OMaRDI QIDQ1899443zbMATH OpenWikidataFDO

Authors Jan van den Heuvel

Publication date 29 September 1996

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

zbMATH Keywords

eigenvaluesHamiltonian cycleLaplacian matrixPetersen graphHamiltonian graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A domain monotonicity theorem for graphs and Hamiltonicity
• Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
• Energy and Hamiltonicity of graphs
• Detecting Hamiltonian cycles
• Spectral results on some Hamiltonian properties of graphs

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• A characterization of the smallest eigenvalue of a graph
• A domain monotonicity theorem for graphs and Hamiltonicity
• Graph theory
• Laplacian matrices of graphs: A survey
• Problems in algebraic combinatorics
• Toughness, hamiltonicity and split graphs

Cited in

(52)

• Spectral condition for Hamiltonicity of a graph
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Spectral radius and Hamiltonian graphs
• The quasi-tree graph with maximum Laplacian spread
• Eigenvalues and triangles in graphs
• Open problem on \(\sigma\)-invariant
• Some properties of the spectrum of graphs
• Spectral radius and Hamiltonicity of graphs
• Recent advances on the Hamiltonian problem: survey III
• A domain monotonicity theorem for graphs and Hamiltonicity
• \(Q\)-integral graphs with at most two vertices of degree greater than or equal to three
• Eigenvalue ratios of non-negatively curved graphs
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Spectral preorder and perturbations of discrete weighted graphs
• Maximum Laplacian energy of unicyclic graphs
• Graph homomorphisms and nodal domains
• On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication
• Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
• Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph
• Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
• Relation between signless Laplacian energy, energy of graph and its line graph
• Signless Laplacian eigenvalues and circumference of graphs
• Matching number, Hamiltonian graphs and magnetic Laplacian matrices
• Interlacing eigenvalues and graphs
• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
• The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• On Hamiltonian cycles and Hamiltonian paths
• Eigenspaces of Hamming graphs and unitary Cayley graphs
• On a conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
• On incidence energy of graphs
• Extremal problems on the Hamiltonicity of claw-free graphs
• Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
• Detecting Hamiltonian cycles
• Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type
• On the least Q-eigenvalue of a non-bipartite Hamiltonian graph
• Some graphs determined by their (signless) Laplacian spectra.
• Automated conjecturing. III. Property-relations conjectures
• Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching
• Energy and Hamiltonicity of graphs
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• An interlacing technique for spectra of random walks and its application to finite percolation clusters
• Hamilton cycles in Euler tour graphs
• Maximum degree and minimum degree spectral radii of some graph operations
• Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
• Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
• Laplacian integral graphs with a given degree sequence constraint
• The Laplacian spread of line graphs
• The Laplacian spectrum of a graph
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and the 2-power of Hamilton cycle
• Spectral conditions for some graphical properties

This page was built for publication: Hamilton cycles and eigenvalues of graphs

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