On the Pendant Number of Some New Graph Classes

Authors

  • Jomon K Sebastian Manonmaniam Sundaranar University, Tirunelveli
  • Joseph Varghese Kureethara CHRIST(Deemed to be University), Bengaluru 560029
  • Sudev Naduvath CHRIST(Deemed to be University), Bengaluru 560029
  • Charles Dominic CHRIST(Deemed to be University), Bengaluru 560029

DOI:

https://doi.org/10.37591/rrdms.v6i1.1900

Keywords:

Decomposition, path decomposition, pendant number

Abstract

Abstract

A 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, 05C40

Cite this Article

Jomon 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.

Published

2019-05-03

Issue

Section

Research Articles