Broadcasts on paths and cycles
Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena · Discrete Applied Mathematics · 2020
A broadcast on a graph G=(V,E) is a function f:V⟶{0,…,diam(G)} such that f(v)≤eG(v) for every vertex v∈V, where diam(G) denotes the diameter of G and eG(v) the eccentricity of v in G. The cost of such a broadcast is then the value ∑v∈Vf(v). Various types of broadcast functions on graphs have been considered in the literature, in relation with domination, irredundance, independence or packing, leading to the introduction of several broadcast numbers on graphs. In this paper, we determine these broadcast numbers for all paths and cycles, thus answering a question raised in Ahmadi et al. (2015).