Double Even Star Decomposition of Complete Bipartite Graphs

Abstract

Let G be a finite, connected, undirected graph without loops or multiple edges. A decomposition               of G is said to be an even star decomposition if each is a star and  for all   A graph G is said to have Double Even Star Decomposition (DESD) if G can be decomposed into 2k stars . In this paper, we characterize Double Even Star Decomposition of complete bipartite graphs of the form  .