Some minimum broadcast graphs

DOI10.1016/0166-218X(94)90190-2zbMath0807.94028OpenAlexW2075519505MaRDI QIDQ1339895

Jean-François Saclé, Maryvonne Maheo

Publication date: 5 March 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90190-2

zbMATH Keywords

broadcast graph

Mathematics Subject Classification ID

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

Related Items (14)

Minimum \(k\)-broadcast graphs ⋮ A minimum broadcast graph on 63 vertices ⋮ Some minimum broadcast graphs ⋮ The complexity of finding a broadcast center ⋮ Lower bounds for the size in four families of minimum broadcast graphs ⋮ 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 ⋮ More broadcast graphs ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ A New Construction of Broadcast Graphs ⋮ The broadcast function value \(B(23)\) is \(33\) or \(34\). ⋮ Compound constructions of broadcast networks

Cites Work

• Unnamed Item
• Sparse broadcast graphs
• Minimum broadcast graphs
• Some minimum broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: Some minimum broadcast graphs