Abstract
A decomposition of a graph G is a collection of its edge disjoint sub-graphs such that their union is G. A path decomposition of a graph is a decomposition of it into paths. In this paper, we define the pendant number Π p as the minimum number of end vertices of paths in a path decomposition of G and determine this parameter for certain fundamental graph classes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
