Upper bounds on the broadcast function using minimum dominating sets
From MaRDI portal
Publication:456886
DOI10.1016/j.disc.2012.06.016zbMath1252.05161MaRDI QIDQ456886
Arthur L. Liestman, Hovhannes A. Harutyunyan
Publication date: 16 October 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.06.016
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, Binary linear programming models for robust broadcasting in communication networks, Tight lower bounds on broadcast function for \(n = 24\) and 25, Efficient broadcast trees for weighted vertices, The shortest path problem in the Knödel graph, Efficient construction of broadcast graphs, Diametral broadcast graphs, A New Construction of Broadcast Graphs, Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse broadcast graphs
- New gossips and telephones
- Compound constructions of broadcast networks
- Methods and problems of communication in usual networks
- A minimum broadcast graph on 63 vertices
- A survey on Knödel graphs.
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- On the monotonicity of the broadcast function
- More broadcast graphs
- Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
- An Efficient Vertex Addition Method for Broadcast Networks
- On the minimum path problem in Knödel graphs
- A survey of gossiping and broadcasting in communication networks
- Towards a theory of domination in graphs
- A Note on the Dimensionality of Modified Knödel Graphs
- Tight Bounds on Mimimum Broadcast Networks
- Minimum multiple message broadcast graphs
- Complete rotations in Cayley graphs
