Boundary Domination of Line and Middle Graph of Wheel Graph Families

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 graphG is called the bound-ary 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