Containment of butterflies in networks constructed by the line digraph operation

DOI10.1016/S0020-0190(96)00183-4zbMath1337.68209OpenAlexW2070829455MaRDI QIDQ290188

Toru Hasunuma, Yukio Shibata

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00183-4

zbMATH Keywords

combinatorial problemsinterconnection networksparallel processingde Bruijn graphsbutterfly graphscontainmentKautz graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Queue layouts of iterated line directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of Kautz networks
• The underlying graph of a line digraph
• Line Digraph Iterations and the (d, k) Digraph Problem
• Group Action Graphs and Parallel Architectures
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Maximally connected digraphs
• On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
• Broadcasting and Gossiping in de Bruijn Networks

This page was built for publication: Containment of butterflies in networks constructed by the line digraph operation