Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
From MaRDI portal
Publication:6103475
DOI10.1016/j.dam.2023.03.002zbMath1515.05137OpenAlexW4365456027MaRDI QIDQ6103475
Hovhannes A. Harutyunyan, Zhi-yuan Li
Publication date: 5 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.002
Communication networks in operations research (90B18) Information theory (general) (94A15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary linear programming models for robust broadcasting in communication networks
- Tight lower bounds on broadcast function for \(n = 24\) and 25
- Upper bounds on the broadcast function using minimum dominating sets
- Sparse broadcast graphs
- New gossips and telephones
- Minimum broadcast graphs
- Compound constructions of broadcast networks
- Methods and problems of communication in usual networks
- A minimum broadcast graph on 63 vertices
- Some minimum broadcast graphs
- A survey on Knödel graphs.
- Lower bounds for the size in four families of minimum broadcast graphs
- More broadcast graphs
- Efficient construction of broadcast graphs
- Improved upper and lower bounds fork-broadcasting
- A New Construction of Broadcast Graphs
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
- An Efficient Vertex Addition Method for Broadcast Networks
- A survey of gossiping and broadcasting in communication networks
- On the construction of minimal broadcast networks
- Minimal broadcast networks
- A Note on the Dimensionality of Modified Knödel Graphs
- Line-broadcasting in complete k -ary trees
- Antepenultimate broadcasting
- Tight Bounds on Mimimum Broadcast Networks
- New Lower Bounds on Broadcast Function
- A new method for constructing minimal broadcast networks
- A minimum broadcast graph on 26 vertices
This page was built for publication: Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
