Abstract
A dominating broadcast of a graph G is a function f:V(G)→{0,1,2,…,diam(G)} such that f(v)⩽e(v) for all v∈V(G), where e(v) is the eccentricity of v, and for every u∈V(G), there exists a vertex v with f(v)⩾1 and d(u,v)⩽f(v). The cost of f is ∑v∈V(G)f(v). The minimum cost over all the dominating broadcasts of G is called the broadcast domination number γb(G) of G. In this paper, we give new upper and lower bounds for γb(G). We show that both the bounds are tight. Also, we improve the upper bound for a subclass of regular graphs. Further, we explore the broadcast domination numbers of generalized Petersen graphs and a subclass of circulant graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
