Improved lower bound on broadcast function based on graph partition

DOI10.1007/978-3-319-78825-8_18MaRDI QIDQ1642698zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Zhiyuan Li

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78825-8_18

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Communication networks in operations research (90B18)

Recommendations

• New lower bounds on broadcast function
• Improved upper and lower bounds for \(k\)-broadcasting
• Lower bounds for the size in four families of minimum broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks
• A minimum broadcast graph on 26 vertices

Cited in

(1)

• New lower bounds on broadcast function

This page was built for publication: Improved lower bound on broadcast function based on graph partition

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