A note on perfect lucky k-colourable graphs

Title

A note on perfect lucky k-colourable graphs

Creator

Kok J.; Kureethara J.V.

Description

This paper presents the notion of perfect Lucky k-colouring. Basic conditions for a perfect Lucky k-colourable graph are presented. Application thereof is then presented by obtaining the Lucky 4-polynomials for all connected graphs G on six vertices with ten edges. The chromatic number of these connected graphs is ?(G) = 3 or 4. For k = max{?(G): 3 or 4g = 4, it is possible to find Lucky 4-polynomials for all graphs on six vertices and ten edges. The methodology improves substantially on the fundamental methodology such that, vertex partitions begin with Lucky partition forms immediately. Finally, further problems for research related to this study are presented. 2020, International Scientific Research Publications. All rights reserved.

Source

Journal of Mathematics and Computer Science, Vol-21, No. 3, pp. 192-197.

Date

2020-01-01

Publisher

International Scientific Research Publications

Subject

Lucky k-polynomial; Lucky ?-polynomial; Perfect Lucky k-colouring

Coverage

Kok J., City of Tshwane, South Africa; Kureethara J.V., CHRIST (Deemed to be a University), Bangalore, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 2008949X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22436/jmcs.021.03.03

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085048819&doi=10.22436%2fjmcs.021.03.03&partnerID=40&md5=9d074ab326abe12e4f6fc9ecbc63c6cc