The Hamiltonian property of generalized de Bruijn digraphs (Q1179462): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Large fault-tolerant interconnection networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized de Bruijn digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity of Imase and Itoh digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Design to Minimize Diameter on Building-Block Network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank | |||
Normal rank |
Latest revision as of 12:46, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Hamiltonian property of generalized de Bruijn digraphs |
scientific article |
Statements
The Hamiltonian property of generalized de Bruijn digraphs (English)
0 references
26 June 1992
0 references
Let \(G_ B(n,d)\) denote the digraph with \(n\) nodes \(0,1,\dots,n-1\) and \(nd\) arcs of the form \(\overrightarrow{ij}\) where \(j=di+r\) (mod \(n\)), \(0\leq i\leq n-1\), \(0\leq r\leq d-1\). The digraph \(G_ I(n,d)\) is defined similarly except that now \(j=d(n-1-i)+r\). The authors' main result is that if \(d\geq 3\) and \(gcd(n,d)=1\), then both \(G_ B(n,d)\) and \(G_ I(n,d)\) have Hamilton circuits. The results in this paper plus results known earlier settle the problem of determining which of these graphs wave Hamilton circuits.
0 references
de Bruijn digraphs
0 references
Hamilton circuits
0 references