• ASCENDING GRAPHOIDAL TREE COVER
Abstract
Ascending graphoidal tree cover of a graph G is a partition of edges of G into trees G1,G2,…,Gn such that |E(Gi)|<|E(Gi+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.
Keywords
Graphoidal tree cover, Ascending cover, Ascending graphoidal tree cover.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |