An Efficient Vertex Addition Method for Broadcast Networks

DOI10.1080/15427951.2008.10129163zbMath1184.68033OpenAlexW1981121951MaRDI QIDQ3400884

Hovhannes A. Harutyunyan

Publication date: 27 January 2010

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2008.10129163

zbMATH Keywords

broadcastingsparse networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (12)

Binary linear programming models for robust broadcasting in communication networks ⋮ On equitable colouring of Knödel 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 ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ Efficient construction of broadcast graphs ⋮ Diametral broadcast graphs ⋮ The shortest path problem in the Knödel graph ⋮ A New Construction of Broadcast Graphs ⋮ Total domination in cubic Knodel graphs

This page was built for publication: An Efficient Vertex Addition Method for Broadcast Networks