Abstract A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pendant number Π p is the minimum number of end vertices of paths in a path decomposition of G. In this paper, we determine the pendant number of corona products and rooted products of paths and cycles and obtain some bounds for the pendant number for some specific derived graphs. Further, for any natural number n, the existence of a connected graph with pendant number n has also been established.
Discussion(0)
No comments yet. Be the first to comment.