Broadcasts in graphs Original Research Article

We say that a function image is a broadcast if for every vertex image, image, where image denotes the diameter of G and image denotes the eccentricity of image. The cost of a broadcast is the value image. In this paper we introduce and study the minimum and maximum costs of several types of broadcasts in graphs, including dominating, independent and efficient broadcasts.