Let G = (V, E) be a connected graph. A subset S of V (G) is called a boundary dominating set if every vertex of V − S is boundary dominated by some vertex of S. The minimum taken over all boundary dominating sets of a graph G is called the boundary domination number of G and is denoted by γ b (G). We define the boundary domatic number in graphs. Exact values of of Wheel Graph Families are obtained and some other interesting results are established.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.