Boundary Domination in Total Graphs

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(G) -- S is vertex boundary dominated by some vertex of S. The minimum taken over all boundary dominating sets of G is called the boundary domination number of G and is denoted by γ sub b /sub (G). In this paper we introduce the boundary domination in Total graph