Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Hamiltonicity of large generalized de Bruijn cycles

Guillaume Ducoffe 1 
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : In this article, we determine when the large generalized de Bruijn cycles BGC(p, d, n) are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized p-cycles. They are the Kronecker product of the generalized de Bruijn digraph GB(d, n) and the dicycle of length p, where GB(d, n) is the digraph whose vertices are labeled with the integers modulo n such that there is an arc from vertex i to vertex j if, and only if, j ≡ di + α (mod n), for every α with 0 ≤ α ≤ d − 1.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Guillaume Ducoffe Connect in order to contact the contributor
Submitted on : Thursday, January 15, 2015 - 1:52:07 PM
Last modification on : Saturday, June 25, 2022 - 11:15:36 PM
Long-term archiving on: : Friday, September 11, 2015 - 6:50:21 AM


Files produced by the author(s)




Guillaume Ducoffe. Hamiltonicity of large generalized de Bruijn cycles. Discrete Applied Mathematics, Elsevier, 2013, 161, pp.2200 - 2204. ⟨10.1016/j.dam.2013.02.027⟩. ⟨hal-01103786⟩



Record views


Files downloads