The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges

R.H. Teunter; E.S. van der Poort

doi:10.1016/S0167-6377(99)00075-9

The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges

R.H. Teunter, E.S. van der Poort

Research output: Contribution to journal › Article › Academic › peer-review

1 Citation (Scopus)

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	https://doi.org/10.1016/S0167-6377(99)00075-9
Publication status	Published - 2000

Access to Document

10.1016/S0167-6377(99)00075-9

Cite this

@article{fb3af8ab5f0c4f8d944279f94d6d0ff5,

title = "The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges",

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.",

author = "R.H. Teunter and \{van der Poort\}, E.S.",

year = "2000",

doi = "10.1016/S0167-6377(99)00075-9",

language = "English",

volume = "26",

pages = "91--98",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges

AU - Teunter, R.H.

AU - van der Poort, E.S.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

U2 - 10.1016/S0167-6377(99)00075-9

DO - 10.1016/S0167-6377(99)00075-9

M3 - Article

SN - 0167-6377

VL - 26

SP - 91

EP - 98

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges

Abstract

Access to Document

Fingerprint

Cite this