Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs

DOI10.1007/978-3-319-53007-9_18zbMath1359.68019OpenAlexW2585687159MaRDI QIDQ2971647

Hovhannes A. Harutyunyan, Zhi-yuan Li

Publication date: 7 April 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_18

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Unnamed Item ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ On linear-time data dissemination in dynamic rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight lower bounds on broadcast function for \(n = 24\) and 25
• Upper bounds on the broadcast function using minimum dominating sets
• Sparse broadcast graphs
• New gossips and telephones
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• A minimum broadcast graph on 63 vertices
• Some minimum broadcast graphs
• A survey on Knödel graphs.
• Lower bounds for the size in four families of minimum broadcast graphs
• More broadcast graphs
• Efficient construction of broadcast graphs
• Improved upper and lower bounds fork-broadcasting
• A New Construction of Broadcast Graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• A survey of gossiping and broadcasting in communication networks
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• A Note on the Dimensionality of Modified Knödel Graphs
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks
• New Lower Bounds on Broadcast Function
• A new method for constructing minimal broadcast networks
• A minimum broadcast graph on 26 vertices

This page was built for publication: Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs