Some New Results on the Rainbow Neighbourhood Number of Graphs

Title

Some New Results on the Rainbow Neighbourhood Number of Graphs

Creator

Naduvath S.; Chandoor S.; Kalayathankal S.J.; Kok J.

Description

A rainbow neighbourhood of a graph G is the closed neighbourhood N[v] of a vertex v? V(G) which contains at least one coloured vertex of each colour in the chromatic colouring C of G. Let G be a graph with a chromatic colouring C defined on it. The number of vertices in G yielding rainbow neighbourhoods is called the rainbow neighbourhood number of the graph G, denoted by r?(G). Rainbow neighbourhood number of the complements and products of certain fundamental graph classes are discussed in this paper. 2018, The National Academy of Sciences, India.

Source

National Academy Science Letters, Vol-42, No. 3, pp. 249-252.

Date

2019-01-01

Publisher

Springer

Subject

Colour classes; Rainbow neighbourhood; Rainbow neighbourhood number

Coverage

Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, 560029, Karnataka, India; Chandoor S., Department of Mathematics, Research and Development Centre, Bharathiar University, Coimbatore, 641046, Tamil Nadu, India; Kalayathankal S.J., Department of Mathematics, Kuriakose Elias College Mannanam, Kottayam, 686561, Kerala, India; Kok J., Tshwane Metropolitan Police Department, City of Tshwane, South Africa

Rights

Restricted Access

Relation

ISSN: 0250541X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1007/s40009-018-0740-0

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85067286979&doi=10.1007%2fs40009-018-0740-0&partnerID=40&md5=e98596720ad3ab74e0396ea45e50348e