A minimum broadcast graph on 26 vertices

DOI10.1016/S0893-9659(01)00082-9MaRDI QIDQ5950681zbMATH OpenOpenAlexFDO

Authors Jianguo Zhou, Keming 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

broadcast graphcommunication network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• A new construction of broadcast graphs
• More broadcast graphs
• A new construction of broadcast graphs
• The broadcast function value \(B(23)\) is \(33\) or \(34\).
• Lower bounds for the size in four families of minimum broadcast graphs

Cites work

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

Cited in

(18)

• Minimum broadcast digraphs
• Minimum \(k\)-broadcast graphs
• The broadcast function value \(B(23)\) is \(33\) or \(34\).
• Improved lower bound on broadcast function based on graph partition
• A 1-relaxed minimum broadcast graph on 15 vertices.
• Lower bounds for the size in four families of minimum broadcast graphs
• More broadcast graphs
• The complexity of finding a broadcast center
• A new construction of broadcast graphs
• Efficient construction of broadcast graphs
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Tight lower bounds on broadcast function for n = 24 and 25
• scientific article; zbMATH DE number 733793 (Why is no real title available?)
• Minimum multiple originator broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Bounds on broadcast time in well-connected graphs
• Broadcast graph is NP-complete

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950681)