A Note on the Rainbow Neighbourhood Number of Certain Graph Classes

Title

A Note on the Rainbow Neighbourhood Number of Certain Graph Classes

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 colored vertex of each color in the chromatic coloring C of G. Let G be a graph with a chromatic coloring 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). In this paper, rainbow neighbourhood number of certain graph classes are discussed. 2018, The National Academy of Sciences, India.

Source

National Academy Science Letters, Vol-42, No. 2, pp. 135-138.

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., Centre for Studies in Discrete Mathematics, Vidya Academy of Science and Technology Thalakkottukara, Thrissur, 680501, Kerala, India

Rights

Restricted Access

Relation

ISSN: 0250541X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1007/s40009-018-0702-6

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064542082&doi=10.1007%2fs40009-018-0702-6&partnerID=40&md5=553041830605b8467382ebc5f95333e7