| Title:
|
Finding a Hamiltonian cycle using the Chebyshev polynomials (English) |
| Author:
|
Lamač, Jan |
| Author:
|
Vlasák, Miloslav |
| Language:
|
English |
| Journal:
|
Programs and Algorithms of Numerical Mathematics |
| Volume:
|
Proceedings of Seminar. Hejnice, June 23-28, 2024 |
| Issue:
|
2024 |
| Year:
|
|
| Pages:
|
95-104 |
| . |
| Category:
|
math |
| . |
| Summary:
|
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. (English) |
| Keyword:
|
Hamiltonian cycle |
| Keyword:
|
Chebyshev polynomial |
| Keyword:
|
minimization of functional |
| MSC:
|
65F08 |
| MSC:
|
65M15 |
| MSC:
|
65N15 |
| DOI:
|
10.21136/panm.2024.09 |
| . |
| Date available:
|
2025-06-02T07:41:20Z |
| Last updated:
|
2025-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/703217 |
| . |
