De Bruijn digraphs and affine transformations
From MaRDI portal
Publication:2567205
DOI10.1016/j.ejc.2004.06.018zbMath1074.05041OpenAlexW2063520651MaRDI QIDQ2567205
Publication date: 29 September 2005
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.06.018
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
Adjacency polynomials of digraph transformations ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Strongly connected multivariate digraphs ⋮ An Expansion Property of Boolean Linear Maps ⋮ Linear dynamical systems of dimension two over the ring of integers modulo pt ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Highly arc transitive digraphs
- Large generalized cycles
- Cayley digraphs from complete generalized cycles
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
- Generalized de Bruijn digraphs and the distribution of patterns in \(\alpha\)-expansions
- Self-Similar Functions Generated by Cellular Automata
- Universality of iterated networks
- Layered cross product&mdashA technique to construct interconnection networks
- Cayley Digraphs Based on the de Bruijn Networks
- Isomorphisms of the De Bruijn digraph and free‐space optical networks
- [https://portal.mardi4nfdi.de/wiki/Publication:4887734 Components and graph automorphisms of standard 2 � 2-switch banyan networks]
This page was built for publication: De Bruijn digraphs and affine transformations