Generalized de Bruijn digraphs
Networks
The Hamiltonian property of generalized de Bruijn digraphs
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics
Disjoint paths of bounded length in large generalized cycles
Discrete Mathematics
On the superconnectivity of generalized p-cycles
Discrete Mathematics
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
The consecutive-4 digraphs are Hamiltonian
Journal of Graph Theory
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Handbook of Product Graphs, Second Edition
Handbook of Product Graphs, Second Edition
The Hamiltonian property of consecutive-d digraphs
Mathematical and Computer Modelling: An International Journal
The hamiltonian property of the consecutive-3 digraph
Mathematical and Computer Modelling: An International Journal
The Hamiltonian property of linear functions
Operations Research Letters
| Hi-index | 0.04 |
In this article, we determine when the large generalized de Bruijn cycles are Hamiltonian. These digraphs have been introduced by Gomez, Padro and Perennes as large interconnection networks with small diameter and they are a family of generalized cycles. They are Kronecker products of generalized de Bruijn digraphs and dicycles.