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

Full description

Bibliographic Details
Main Authors: Sebastian Jomon K., Kureethara Joseph Varghese, Naduvath Sudev, Dominic Charles
Format: Article
Language:English
Published: Sciendo 2019-08-01
Series:Acta Universitatis Sapientiae: Informatica
Subjects:
Online Access:https://doi.org/10.2478/ausi-2019-0002