On the rainbow neighbourhood number of set-graphs

Title

On the rainbow neighbourhood number of set-graphs

Creator

Kok J.; Naduvath S.

Description

In this paper, we present results for the rainbow neighbourhood numbers of set-graphs. It is also shown that set-graphs are perfect graphs. The intuitive colouring dilemma in respect of the rainbow neighbourhood convention is clarified as well. Finally, the new notion of the maximax independence, maximum proper colouring of a graph and a new graph parameter called the i-max number of G are introduced as a new research direction. 2020 the author(s).

Source

Journal of Mathematical and Computational Science, Vol-10, No. 2, pp. 394-402.

Date

2020-01-01

Publisher

SCIK Publishing Corporation

Subject

i-max number; Maximax independence; Maximum proper colouring; Rainbow neighbourhood; Rainbow neighbourhood number; Set-graph

Coverage

Kok J., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 560029, Karnataka, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 560029, Karnataka, 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/4374

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079221768&doi=10.28919%2fjmcs%2f4374&partnerID=40&md5=1a0cc995928d013e68d3ebd40598df0d