Jomon K. Sebastian1, Joseph Varghese Kureethara2 1Manonmaniam Sundaranar University
Tirunelveli, Tamil Nadu, 627012, INDIA 2Department of Mathematics
CHRIST (Deemed to be University)
Bangalore, Karnataka, 560029, INDIA
A decomposition of a graph is a collection of its edge disjoint sub-graphs such that their union is . A path decomposition of a graph is a decomposition of it into paths. In this paper, we define the pendant number as the minimum number of end vertices of paths in a path decomposition of and determine this parameter for certain fundamental graph classes.