ASCENDING GRAPHOIDAL TREE COVER

Abstract

Ascending graphoidal tree cover of a graph G is a partition of edges of G into trees G₁,G₂,…,G_n such that |E(G_i)|<|E(G_i+1)| for all i=1 to n-1 and every vertex  of G is an internal vertex of at most one tree. In this paper, we investigate the ascending graphoidal tree cover for some standard graphs.