Chromatic completion number

Title

Chromatic completion number

Creator

Kok J.; Mphako-Banda E.G.

Description

The well known concept of proper vertex colouring of a graph is used to introduce the construction of a chromatic completion graph and determining its related parameter, the chromatic completion number of a graph. The chromatic completion numbers of certain classes of cycle derivative graphs and helm graphs are then presented. Finally, we discuss further problems for research related to this concept. 2020 the author(s).

Source

Journal of Mathematical and Computational Science, Vol-10, No. 6, pp. 2971-2983.

Date

2020-01-01

Publisher

SCIK Publishing Corporation

Subject

Bad edge; Chromatic completion graph; Chromatic completion number; Sum-term partition

Coverage

Kok J., Department of Mathematics, CHRIST University, Bangalore, India; Mphako-Banda E.G., Department of Mathematics, University of Witwatersrand, Johannesburg, South Africa

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/5028

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85095949030&doi=10.28919%2fjmcs%2f5028&partnerID=40&md5=6284e714dcfc62651904216560337349