Pendant number of graphs

Title

Pendant number of graphs

Creator

Sebastian J.K.; Kureethara J.V.

Description

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. 2018 Academic Publications.

Source

International Journal of Applied Mathematics, Vol-31, No. 5, pp. 679-689.

Date

2018-01-01

Publisher

Academic Publications Ltd.

Subject

Decomposition; Hamilton decomposition; Path decomposition; Pendant number

Coverage

Sebastian J.K., Manonmaniam Sundaranar University, Tirunelveli, Tamil Nadu, 627012, India; Kureethara J.V., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, Karnataka, 560029, India

Rights

All Open Access; Gold Open Access; Green Open Access

Relation

ISSN: 13111728

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.12732/ijam.v31i5.12

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85067647522&doi=10.12732%2fijam.v31i5.12&partnerID=40&md5=c438da3956908de2bd2179c663c7d637