Detecting Hamiltonian cycles

DOI10.1016/0096-3003(92)90042-YzbMATH Open0739.05057OpenAlexW2051733438MaRDI QIDQ1184809FDOQ1184809

Charles N. Friedman

Publication date: 28 June 1992

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(92)90042-y

zbMATH Keywords

algorithmseigenvaluesHamiltonian cycleadjacency matrixdiagonal matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• On Siegel's lemma
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Hamilton cycles and eigenvalues of graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Determinants and Longest Cycles of Graphs 👍 👎
• Some necessary conditions for a graph to be Hamiltonian 👍 👎

This page was built for publication: Detecting Hamiltonian cycles

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