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