Abstract
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. The main results are a lower bound and an upper bound, both given by closed-form formulas, for the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges.
Original language | English |
---|---|
Pages (from-to) | 91-98 |
Journal | Operations Research Letters |
Volume | 26 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2000 |