Some new results on proper colouring of edge-set graphs

Title

Some new results on proper colouring of edge-set graphs

Creator

Kok J.; Naduvath S.

Description

In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation study. The main result is deriving the chromatic number of the edge-set graph of a path, Pn+1, n ? 1. It is also shown that edge-set graphs for paths are perfect graphs. 2020 the author(s).

Source

Journal of Mathematical and Computational Science, Vol-10, No. 3, pp. 544-553.

Date

2020-01-01

Publisher

SCIK Publishing Corporation

Subject

Chromatic colouring; Edge-set graph; Rainbow neighbourhood; Rainbow neighbourhood number

Coverage

Kok J., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 560029, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 560029, India

Rights

All Open Access; Gold Open Access; Green Open Access

Relation

ISSN: 19275307

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.28919/JMCS/4464

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083046637&doi=10.28919%2fJMCS%2f4464&partnerID=40&md5=f48ec954fb9933c1cf3ba2aed926c2a4