Isomorphic factorization, the Kronecker product and the line digraph
DOI10.1016/j.ipl.2006.06.014zbMath1185.05118OpenAlexW2147720275MaRDI QIDQ845899
Yuuki Tanaka, Yukio Shibata, Hiroyuki Kawai
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.014
Kronecker productline digraphKautz digraphinterconnection networkisomorphic factorizationbinary generalized de Bruijn digraph
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Hamilton circuits in the directed wrapped Butterfly network
- Extension of de Bruijn graph and Kautz graph
- Isomorphic factorization of de Bruijn digraphs
- Connectivity of Regular Directed Graphs with Small Diameters
- Isomorphic Factorisations. I: Complete Graphs
- Isomorphic factorisations V: Directed graphs
- Isomorphic factorizations X: Unsolved problems
This page was built for publication: Isomorphic factorization, the Kronecker product and the line digraph