STM Journals Peer-reviewed research from Consortium e-Learning Network

Research & Reviews: Discrete Mathematical Structures

On the Pendant Number of Some New Graph Classes

  1. Jomon K Sebastian
  2. Joseph Varghese Kureethara
  3. Sudev Naduvath
  4. 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 number.MSC2010: 05C70, 05C38, 05C40Cite this ArticleJomon K. Sebastian, Joseph Varghese Kureethara, Sudev Naduvath, Charles Dominic. On the Pendant Number of Some New Graph Classes. Research & Reviews: Discrete Mathematical Structures. 2019; 6(1): 15–21p.

Keywords

Support