An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs

DOI10.1016/0166-218X(95)98134-MzbMath0830.05042MaRDI QIDQ1897350

Marc Baumslag

Publication date: 22 January 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

connectivityalgebraic analysisDe Bruijn digraphsshuffle-exchange digraphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Hamilton cycles in Trivalent Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• On the connectivity of the De Bruijn graph
• Vosperian and superconnected abelian Cayley digraphs
• Vertex-transitive graphs
• Connectivity of Regular Directed Graphs with Small Diameters
• Graphs with Given Group and Given Graph-Theoretical Properties
• Group Action Graphs and Parallel Architectures
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs