Tight lower bounds on broadcast function for n = 24 and 25
From MaRDI portal
Publication:401149
DOI10.1016/J.DAM.2014.05.018zbMATH Open1298.05291OpenAlexW2085363133MaRDI QIDQ401149FDOQ401149
Hovhannes A. Harutyunyan, Georgy Barsky, 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
Recommendations
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Sparse broadcast graphs
- Minimum broadcast graphs
- Compound constructions of broadcast networks
- Time-relaxed broadcasting in communication networks
- A 1-relaxed minimum broadcast graph on 15 vertices.
- More broadcast graphs
- An Efficient Vertex Addition Method for Broadcast Networks
- On the construction of minimal broadcast networks
- Upper bounds on the broadcast function using minimum dominating sets
- Antepenultimate broadcasting
- On time-relaxed broadcasting networks
- A minimum broadcast graph on 63 vertices
- Some minimum broadcast graphs
- The broadcast function value \(B(23)\) is \(33\) or \(34\).
- Lower bounds for the size in four families of minimum broadcast graphs
- Title not available (Why is that?)
- A minimum broadcast graph on 26 vertices
Cited In (5)
- Binary linear programming models for robust broadcasting in communication networks
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- A New Construction of Broadcast Graphs
- 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)
