Premium
Generalized hamiltonian circuits in the cartesian product of two‐directed cycles
Author(s) -
Jungreis Douglas S.
Publication year - 1988
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.3190120112
Subject(s) - cartesian product , digraph , mathematics , generalization , combinatorics , hamiltonian (control theory) , product (mathematics) , hamiltonian path , cartesian coordinate system , discrete mathematics , graph , mathematical analysis , geometry , mathematical optimization
We find necessary and sufficient conditions for the existence of a closed walk that traverses r vertices twice and the rest once in the Cayley digraph of Z m ⊕ Z n . This is a generalization of the results known for r = 0 or 1.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom