Triple Even Star Decomposition of Complete Bipartite Graphs

Abstract

Let G be a finite, connected, undirected graph without loops or multiple edges. A decomposition {G₂, G₄, . . . , G_2k} of G is said to be an even star decomposition if each G_i  is a star and |E(G_i)| = i for all i = 2, 4, . . . , 2k.     A graph G is said to have Triple Even Star Decomposition (TESD) if G can be decomposed into 3k stars {3S₂, 3S₄, . . . , 3S_2k}. In this paper, we characterize Triple Even Star Decomposition of complete bipartite graphs

K_m,n when m = 2 and m = 3.