Particular cycles of a binary de Bruijn digraph

DOI10.1016/J.EJC.2009.03.026zbMath1223.05140OpenAlexW2038935338MaRDI QIDQ966168

B. E. Eshmatov

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.026

zbMATH Keywords

cyclebinary de Bruijn digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Constructing the minimum dominating sets of generalized de Bruijn digraphs

Cites Work

• A note on recursive properties of the de Bruijn, Kautz and FFT digraphs
• Binary de Bruijn cycles under different equivalence relations
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

This page was built for publication: Particular cycles of a binary de Bruijn digraph