Broadcasting on recursively decomposable Cayley graphs

DOI10.1016/0166-218X(94)90183-XzbMath0807.94032OpenAlexW2074290774MaRDI QIDQ1339887

Chandra GowriSankaran

Publication date: 11 December 1994

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90183-x

zbMATH Keywords

Cayley graphsbroadcastingpancake graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry ⋮ Methods and problems of communication in usual networks ⋮ Degree- and time-constrained broadcast networks ⋮ Broadcasting in cycle prefix digraphs ⋮ Minimum time broadcast in faulty star networks ⋮ A family of Cayley graphs on the hexavalent grid ⋮ Broadcasting in hypercubes and star graphs with dynamic faults.

Cites Work

• Unnamed Item
• Unnamed Item
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• A survey of gossiping and broadcasting in communication networks
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Broadcasting on recursively decomposable Cayley graphs