Premium
A census of maximum uniquely hamiltonian graphs
Author(s) -
Barefoot Curtiss A.,
Entringer R. C.
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050313
Subject(s) - hamiltonian path , mathematics , combinatorics , hamiltonian (control theory) , hamiltonian path problem , indifference graph , discrete mathematics , graph , census , sociology , mathematical optimization , demography , population
We show that there are 2 [n/2]‐4 largest graphs of order n ≥ 7 having exactly one hamiltonian cycle. a recursive procedure for constructing these graphs is described.