36,127 research outputs found
Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing the dominating 2-broadcast number is a NP-complete problem, but can be achieved in linear time for trees. We also give an upper bound for this parameter, that is tight for graphs as large as desired.Peer ReviewedPostprint (author's final draft
Minimum congestion spanning trees in planar graphs
The main purpose of the paper is to develop an approach to evaluation or
estimation of the spanning tree congestion of planar graphs. This approach is
used to evaluate the spanning tree congestion of triangular grids
- …