<abstract xmlns="http://www.w3.org/1999/xhtml"><p>A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pendant number Π<sub>p</sub> 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.</p></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.

A study on the pendant number of graph products

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"A study on the pendant number of graph products"}

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

A study on the pendant number of graph products

Online veröffentlicht: 21. Aug. 2019

Seitenbereich: 24 - 40

Eingereicht: 19. Feb. 2019

DOI: https://doi.org/10.2478/ausi-2019-0002

Schlüsselwörter
graph operations, path decomposition, pendant number

© 2019 Jomon K. Sebastian et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

A study on the pendant number of graph products

Online veröffentlicht: 21. Aug. 2019

Seitenbereich: 24 - 40

Eingereicht: 19. Feb. 2019

DOI: https://doi.org/10.2478/ausi-2019-0002

Schlüsselwörtergraph operations, path decomposition, pendant number

© 2019 Jomon K. Sebastian et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
graph operations, path decomposition, pendant number