On the monotonicity of the broadcast function
From MaRDI portal
Publication:1868844
DOI10.1016/S0012-365X(02)00495-8zbMath1032.90055OpenAlexW2069262458MaRDI QIDQ1868844
Hovhannes A. Harutyunyan, Arthur L. Liestman
Publication date: 28 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00495-8
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Binary linear programming models for robust broadcasting in communication networks ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ Efficient construction of broadcast graphs ⋮ Diametral broadcast graphs ⋮ Broadcasting from multiple originators ⋮ The shortest path problem in the Knödel graph ⋮ A linear algorithm for finding the k‐broadcast center of a tree
