A 1-relaxed minimum broadcast graph on 15 vertices.

DOI10.1016/S0893-9659(04)90059-6zbMath1087.90014OpenAlexW1996354598MaRDI QIDQ1764502

Tianxing Yao, Guo-fei Zhou, Jian-guo Zhou

Publication date: 25 February 2005

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(04)90059-6

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05)

Related Items (3)

Binary linear programming models for robust broadcasting in communication networks ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25 ⋮ On time-relaxed broadcasting networks

Cites Work

• Sparse broadcast graphs
• Compound constructions of broadcast networks
• Time-relaxed broadcasting in communication networks
• Lower bounds for the size in four families of minimum broadcast graphs
• Fault-tolerant broadcast graphs
• Minimal broadcast networks
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks
• A minimum broadcast graph on 26 vertices
• Unnamed Item

This page was built for publication: A 1-relaxed minimum broadcast graph on 15 vertices.