Submit Your Manuscript Online

Double Power Of 2 Decomposition [DPo2D] of Some Trees

	International Journal of Scientific Research and Engineering Development (IJSRED)	Full Text:
	Published Issue : Volume-3 Issue-5
	Year of Publication : 2020
	Unique Identification Number : IJSRED-V3I5P38
	Authors : S.Asha, V.G.Smilin Shali
	: Click Here

Abstract :

Let G be a simple, connected 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. In this paper we introduce a new concept called Double power of 2 Decomposition of graphs. A graph G is said to have Double Power of 2 Decomposition if G can be decomposed into subgraphs {2G1, 2G2, . . . , 2Gn} such that each G i 2 is connected and ( ) ,2 i E Gi = for 1 ≤ i ≤ n. Clearly, q = 4[2n - 1]. In this paper, we investigate the properties of some trees which accept Double Power of 2 Decomposition.