Power of 2 Decomposition of a Complete Tripartite Graph K2,4,M and a Special Butterfly Graph
V. G. Smilin Shali1, S. Asha2
1V. G. Smilin Shali*, Research Scholar, Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Kanyakumari, (Tamil Nadu), India.
2Dr. S.Asha, Assistant Professor, Research Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Kanyakumari, (Tamil Nadu), India.
Manuscript received on January 25, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 29, 2020. | PP: 3973-3976 | Volume-9 Issue-3, February 2020. | Retrieval Number: C6525029320/2020©BEIESP | DOI: 10.35940/ijeat.C6525.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Let G be a finite, connected simple graph with p vertices and q edges. If G1, G2,…, Gn are connected edge-disjoint subgraphs of G with E(G) = E(G1) E(G2) E(Gn) , then {G1, G2, …, Gn} is said to be a decomposition of G. A graph G is said to have Power of 2 Decomposition if G can be decomposed into edge-disjoint subgraphs G G G n 2 4 2 , ,…, such that each G i 2 is connected and ( ) 2 , i E Gi for 1 i n. Clearly, 2[2 1] n q . In this paper, we investigate the necessary and sufficient condition for a complete tripartite graph K2,4,m and a Special Butterfly graph, 3 2 5 BF 2m 1 to accept Power of 2 Decomposition.
Keywords: Decomposition of Graph, Power of 2 Decomposition, Complete tripartite graph, Special Butterfly graph.