Dominating Broadcasts in Fuzzy Graphs

Broadcasting problems in graph theory play a significant role in solving many complicated physical problems. However, in real life there are many vague situations that sometimes cannot be modeled using usual graphs. Consequently, the concept of a fuzzy graph GF:(V,σ,μ) has been introduced to deal with such problems. In this study, we are interested in defining the notion of dominating broadcasts in fuzzy graphs. We also show that, in a connected fuzzy graph containing more than one element in σ*, a dominating broadcast always exists, where σ* is {v∈V|σ(v)>0}. In addition, we investigate the relationship between broadcast domination numbers, radii, and domination numbers in a fuzzy graph as follows; γb(GF)≤min{r(GF),γ(GF)}, where γb(GF) is the broadcast domination number, r(GF) is the radius, and γ(GF) is domination numbers in fuzzy graph GF, with |σ*|>1