Broadcasting in cycle prefix digraphs

DOI10.1016/S0166-218X(97)00102-9zbMath0909.05042OpenAlexW1995606384MaRDI QIDQ1392525

Margarida Mitjana, Francesc Comellas

Publication date: 30 March 1999

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

digraphsbroadcast timecycle prefix digraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Which Faber-Moore-Chen digraphs are Cayley digraphs?

Cites Work

• Unnamed Item
• Unnamed Item
• The connectivity of hierarchical Cayley digraphs
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• Broadcasting on recursively decomposable Cayley graphs
• Vertex-symmetric digraphs with small diameter
• Vertex-transitive graphs
• Cycle prefix digraphs for symmetric interconnection networks

This page was built for publication: Broadcasting in cycle prefix digraphs