A new construction of broadcast graphs

DOI10.1007/978-3-319-29221-2_17MaRDI QIDQ2795946zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Zhiyuan Li

Publication date 23 March 2016

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-29221-2_17

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Communication networks in operations research (90B18)

Recommendations

• A new construction of broadcast graphs
• More broadcast graphs
• Efficient construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• A minimum broadcast graph on 26 vertices

Cites work

• A minimum broadcast graph on 26 vertices
• A minimum broadcast graph on 63 vertices
• A new method for constructing minimal broadcast networks
• A Note on the Dimensionality of Modified Knödel Graphs
• A survey on Knödel graphs.
• An Efficient Vertex Addition Method for Broadcast Networks
• Antepenultimate broadcasting
• Compound constructions of broadcast networks
• Efficient construction of broadcast graphs
• scientific article; zbMATH DE number 4141826 (Why is no real title available?)
• scientific article; zbMATH DE number 3702701 (Why is no real title available?)
• scientific article; zbMATH DE number 177869 (Why is no real title available?)
• Lower bounds for the size in four families of minimum broadcast graphs
• Minimal broadcast networks
• Minimum \(k\)-broadcast graphs
• Minimum broadcast graphs
• More broadcast graphs
• New gossips and telephones
• New lower bounds on broadcast function
• On the construction of minimal broadcast networks
• Some minimum broadcast graphs
• Sparse broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks
• Tight lower bounds on broadcast function for n = 24 and 25
• Upper bounds on the broadcast function using minimum dominating sets

Cited in

(18)

• Sparse broadcast graphs
• Compound constructions of broadcast networks
• The broadcast function value \(B(23)\) is \(33\) or \(34\).
• On linear-time data dissemination in dynamic rooted trees
• Lower bounds for the size in four families of minimum broadcast graphs
• More broadcast graphs
• A new construction of broadcast graphs
• A simple construction of broadcast graphs
• Efficient construction of broadcast graphs
• Improved upper and lower bounds for k-broadcasting
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• scientific article; zbMATH DE number 1743971 (Why is no real title available?)
• Antepenultimate broadcasting
• Minimum multiple originator broadcast graphs
• A new method for constructing minimal broadcast networks
• A minimum broadcast graph on 26 vertices
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Broadcasting from multiple originators

This page was built for publication: A new construction of broadcast graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795946)