A minimum broadcast graph on 63 vertices

DOI10.1016/0166-218X(94)90188-0zbMath0807.94033MaRDI QIDQ1339894

Roger Labahn

Publication date: 11 December 1994

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

zbMATH Keywords

graphbroadcasting

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Related Items (10)

On the number of broadcast schemes in networks ⋮ A new construction of broadcast graphs ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25 ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ More broadcast graphs ⋮ Minimum multiple originator broadcast graphs ⋮ A New Construction of Broadcast Graphs ⋮ Compound constructions of broadcast networks

Cites Work

• Sparse broadcast graphs
• New gossips and telephones
• Some minimum broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A minimum broadcast graph on 63 vertices