The Hamiltonian property of generalized de Bruijn digraphs

It has been shown that the generalized de Bruijn digraphs G B ( n, d) and the Imase-Itoh digraphs G I ( n, d) have Hamiltonian circuits of gcd( n, d) > 1. For gcd( n, d) = 1 the problem remains open except for d = 1 and 2. In this paper we give a unified proof for all d ≥ 3 that both G B ( n, d)...

Full description

Saved in:
Bibliographic Details
Published inJournal of combinatorial theory. Series B Vol. 52; no. 1; pp. 1 - 8
Main Authors Du, D.Z, Hsu, D.F, Hwang, F.K, Zhang, X.M
Format Journal Article
LanguageEnglish
Published Duluth, MN Elsevier Inc 01.05.1991
Academic Press
Subjects
Combinatorics. Ordered structures
Exact sciences and technology
Mathematics
Sciences and techniques of general use
Hamiltonian graph
Graph theory
Hamiltonian circuit
Properties
Theorem proving
Online AccessGet full text

Cover

More Information
Summary:It has been shown that the generalized de Bruijn digraphs G B ( n, d) and the Imase-Itoh digraphs G I ( n, d) have Hamiltonian circuits of gcd( n, d) > 1. For gcd( n, d) = 1 the problem remains open except for d = 1 and 2. In this paper we give a unified proof for all d ≥ 3 that both G B ( n, d) and G I ( n, d) have Hamiltonian circuits.
ISSN:0095-8956
1096-0902
DOI:10.1016/0095-8956(91)90084-W