A decomposition of a graph G is a collection of its edge disjoint sub-graphs such that their union is G.A path decomposition of a graph is a decomposition of it into paths.In this paper, we define the pendant number Π p as the minimum number of end vertices of paths in a path decomposition of G and determine this parameter for certain fundamental graph classes.
Discussion(0)
No comments yet. Be the first to comment.