Detecting Hamiltonian cycles

DOI10.1016/0096-3003(92)90042-YzbMath0739.05057OpenAlexW2051733438MaRDI QIDQ1184809

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

algorithmseigenvaluesadjacency matrixHamiltonian cyclediagonal matrix

Mathematics Subject Classification ID

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

Cites Work

• On Siegel's lemma
• Unnamed Item
• Unnamed Item

This page was built for publication: Detecting Hamiltonian cycles