Power of 2 Decomposition of a Complete Tripartite Graph K2,4,M and a Special Butterfly Graph
2020 ◽
Vol 9
(3)
◽
pp. 3973-3976
Keyword(s):
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.
2017 ◽
Vol E100.A
(12)
◽
pp. 2764-2775
◽