THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS UGB(n, n(n+1))

DOI10.1142/S0129054198000040zbMath0970.05026OpenAlexW1982175534MaRDI QIDQ2703012

Luz R. Nochefranca, Polly Wee Sy

Publication date: 2 July 2001

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054198000040

zbMATH Keywords

algorithmdiameterHamiltonian cyclede Bruijn graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• The Hamiltonian property of generalized de Bruijn digraphs
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network

This page was built for publication: THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS UG_B(n, n(n+1))