An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees

Antika Sinha, Sanjoy Kumar Saha, Partha Basuchowdhuri

In this work, we study methodical decomposition of an undirected, unweighted complete graph ($K_n$ of order $n$, size $m$) into minimum number of edge-disjoint trees. We find that…