The Hamiltonian property of generalized de Bruijn digraphs

DOI10.1016/0095-8956(91)90084-WzbMath0736.05039MaRDI QIDQ1179462

S. Singh

Publication date: 26 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

de Bruijn digraphsHamilton circuits

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (19)

On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\) ⋮ Absorbant of generalized de Bruijn digraphs ⋮ The Hamiltonian property of the consecutive-3 digraphs ⋮ Large fault-tolerant interconnection networks ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS UG_B(n, n(n+1)) ⋮ Hamiltonicity of large generalized de Bruijn cycles ⋮ Hamilton cycles in Trivalent Cayley graphs ⋮ Distributed loop network with minimum transmission delay ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ The Hamiltonian property of linear functions ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs ⋮ The Hamiltonian property of consecutive-\(d\) digraphs ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs

Cites Work

• Large fault-tolerant interconnection networks
• A Design for Directed Graphs with Minimum Diameter
• Generalized de Bruijn digraphs
• Connectivity of Imase and Itoh digraphs
• Design to Minimize Diameter on Building-Block Network

This page was built for publication: The Hamiltonian property of generalized de Bruijn digraphs