Medium Domination Decomposition of Zig-Zag Triangle Graphs
Abstract
Let G =(V,E) be a simple connected graph of order P and size q. A decomposition of a graph G is a collection of edge - disjoint subgraphs G1, G2,..Gn of G such that every edge of G belongs to exactly one Gi(1 A decomposition (G1,G2,…,Gn) of a graph G is said to be Medium Domination Decomposition if each Gi is connected, E(G)=E(G1)UE(G2)U...UE(Gn) and ⌊MD(Gi)⌋= i-1, i=1, 2,...,n. Frucht and Harary introduced a new product on two graph and , called corona product denoted by . The object is to construct a new and simple operation on two graphs and called their corona, with the property that the group of the new graph is in general isomorphic with the wreath product of the groups of and .. In this paper, we found out the Medium Domination Number of Zig-Zag Triangle Z(Tt), Z(Tt) ⊙ Km and Z(Tt) ⊙ m and the Medium Domination Decomposition of Zig – Zag Triangle Z(Tt), Z(Tt)⊙ Km and Z(Tt)⊙ m.