1 publication

• Published Subscription 3 May 2019

  On the Pendant Number of Some New Graph Classes

  By Jomon K Sebastian, Joseph Varghese Kureethara, Sudev Naduvath, Charles Dominic

  Abstract: AbstractA decomposition of a graph is a collection of its edge disjoint sub-graphs such that their union is . If all the sub-graphs in the decomposition are paths, then it is a path decomposition. In this paper, we discuss the pendant number, the minimum number of end vertices of paths in a path decomposition of a graph. We also determine this parameter for some graph classes.Keywords: Decomposition, path decomposition, pendant …

  Published in Research & Reviews: Discrete Mathematical Structures · Vol. 6, Issue 1, 2019 · pp. 15–21 Read article →