Decomposing a star graph into disjoint cycles

DOI10.1016/0020-0190(91)90107-SzbMath0735.68066OpenAlexW2092233728MaRDI QIDQ1182082

Selim G. Akl, Ke Qiu, Henk G. Meijer

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90107-s

zbMATH Keywords

decompositioninterconnection networkstar graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (7)

Fault tolerant routing in the star and pancake interconnection networks ⋮ Cycles in butterfly graphs ⋮ Minimum time broadcast in faulty star networks ⋮ THE PERMUTATIONAL GRAPH: A NEW NETWORK TOPOLOGY ⋮ Trivalent Cayley graphs for interconnection networks ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Broadcasting in hypercubes and star graphs with dynamic faults.

Cites Work

• Unnamed Item
• A new algorithm for generation of permutations
• On Group Graphs and Their Fault Tolerance
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Decomposing a star graph into disjoint cycles