On enumerating tournaments that admit exactly one Hamiltonian circuit

✍ Scribed by M.R Garey

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 169 KB
Volume: 13
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90062-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with exactly one hamiltonian circ

Graphs with exactly one hamiltonian circuit

✍ John Sheehan 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

## Abstract Let __h(n__) be the largest integer such that there exists a graph with __n__ vertices having exactly one Hamiltonian circuit and exactly __h(n__) edges. We prove that __h(n__) = [__n__^2^/4]+1 (__n__ ≧ 4) and discuss some related problems.