Tight lower bounds on broadcast function for n = 24 and 25

DOI10.1016/J.DAM.2014.05.018MaRDI QIDQ401149zbMATH OpenOpenAlexFDO

Authors Georgy Barsky, Hovhannes A. Harutyunyan, Hayk Grigoryan

Publication date 26 August 2014

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

Full work available at URL https://doi.org/10.1016/j.dam.2014.05.018

zbMATH Keywords

broadcastingminimum broadcast graphsbroadcast function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• New lower bounds on broadcast function
• Upper bounds on the broadcast function using minimum dominating sets
• scientific article; zbMATH DE number 1500381
• Lower bounds for the size in four families of minimum broadcast graphs
• Improved upper and lower bounds for k-broadcasting

Cites work

• scientific article; zbMATH DE number 3702701 (Why is no real title available?)
• A 1-relaxed minimum broadcast graph on 15 vertices.
• A minimum broadcast graph on 26 vertices
• A minimum broadcast graph on 63 vertices
• An Efficient Vertex Addition Method for Broadcast Networks
• Antepenultimate broadcasting
• Compound constructions of broadcast networks
• Lower bounds for the size in four families of minimum broadcast graphs
• Minimum broadcast graphs
• More broadcast graphs
• On the construction of minimal broadcast networks
• On time-relaxed broadcasting networks
• Some minimum broadcast graphs
• Sparse broadcast graphs
• The broadcast function value \(B(23)\) is \(33\) or \(34\).
• Time-relaxed broadcasting in communication networks
• Upper bounds on the broadcast function using minimum dominating sets

Cited in

(6)

• Binary linear programming models for robust broadcasting in communication networks
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• New lower bounds on broadcast function
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs

This page was built for publication: Tight lower bounds on broadcast function for \(n = 24\) and 25

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