Finding a Hamiltonian cycle using the Chebyshev polynomials
- Programs and Algorithms of Numerical Mathematics, page 95-104
Access Full Article
top
Abstract
topHow to cite
topLamač, Jan, and Vlasák, Miloslav. "Finding a Hamiltonian cycle using the Chebyshev polynomials." Programs and Algorithms of Numerical Mathematics. 2025. 95-104. <http://eudml.org/doc/299964>.
@inProceedings{Lamač2025,
abstract = {We present an algorithm of finding the Hamiltonian cycle in a general undirected graph by minimization of an appropriately chosen functional. This functional depends on the characteristic polynomial of the graph Laplacian matrix and attains its minimum at the characteristic polynomial of the Laplacian matrix of the Hamiltonian cycle.},
author = {Lamač, Jan, Vlasák, Miloslav},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {Hamiltonian cycle; Chebyshev polynomial; minimization of functional},
pages = {95-104},
title = {Finding a Hamiltonian cycle using the Chebyshev polynomials},
url = {http://eudml.org/doc/299964},
year = {2025},
}
TY - CLSWK
AU - Lamač, Jan
AU - Vlasák, Miloslav
TI - Finding a Hamiltonian cycle using the Chebyshev polynomials
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2025
SP - 95
EP - 104
AB - We present an algorithm of finding the Hamiltonian cycle in a general undirected graph by minimization of an appropriately chosen functional. This functional depends on the characteristic polynomial of the graph Laplacian matrix and attains its minimum at the characteristic polynomial of the Laplacian matrix of the Hamiltonian cycle.
KW - Hamiltonian cycle; Chebyshev polynomial; minimization of functional
UR - http://eudml.org/doc/299964
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.