A minimum broadcast graph on 26 vertices

DOI10.1016/S0893-9659(01)00082-9zbMath0983.05054OpenAlexW2093393175MaRDI QIDQ5950681

Jian-guo Zhou, Ke Min Zhang

Publication date: 2 January 2002

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

Full work available at URL: https://doi.org/10.1016/s0893-9659(01)00082-9

zbMATH Keywords

communication networkbroadcast graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

The complexity of finding a broadcast center ⋮ 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 ⋮ Minimum multiple originator broadcast graphs ⋮ A 1-relaxed minimum broadcast graph on 15 vertices. ⋮ A New Construction of Broadcast Graphs

Cites Work

• Parallel concepts in graph theory
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Antepenultimate broadcasting

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