A domain monotonicity theorem for graphs and Hamiltonicity

DOI10.1016/0166-218X(92)90230-8zbMath0765.05071MaRDI QIDQ1192950

Bojan Mohar

Publication date: 27 September 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesLaplacian spectrumLaplacian matrixHamiltonicityPetersen graphlong cyclesdomain monotonicity theorem

Mathematics Subject Classification ID

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

Related Items (17)

Spectral preorder and perturbations of discrete weighted graphs ⋮ Matching number, Hamiltonian graphs and magnetic Laplacian matrices ⋮ Interlacing eigenvalues and graphs ⋮ Hamilton cycles and eigenvalues of graphs ⋮ Graph homomorphisms and nodal domains ⋮ Heuristic search for Hamilton cycles in cubic graphs ⋮ A survey of graph laplacians ⋮ A geometric construction of isospectral magnetic graphs ⋮ Maximum degree and minimum degree spectral radii of some graph operations ⋮ Spectral radius and Hamiltonian graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Signless Laplacian eigenvalues and circumference of graphs ⋮ Spectral radius and Hamiltonicity of graphs ⋮ Laplace eigenvalues of graphs---a survey ⋮ Algebraic conditions for t-tough graphs ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ Spectral condition for Hamiltonicity of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Ramanujan graphs
• Eigenvalues and expanders
• Isoperimetric numbers of graphs
• Eigenvalues of the Laplacian of a graph^∗
• On the Shannon capacity of a graph
• A new 5‐arc‐transitive cubic graph

This page was built for publication: A domain monotonicity theorem for graphs and Hamiltonicity