On the rainbow neighbourhood number of Mycielski type graphs

Title

On the rainbow neighbourhood number of Mycielski type graphs

Creator

Sudev N.K.; Susanth C.; Kalayathankal S.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 rX(G). In this paper, we discuss the rainbow neighbourhood number of the Mycielski type graphs of graphs. 2018 Academic Publications.

Source

International Journal of Applied Mathematics, Vol-31, No. 6, pp. 797-803.

Date

2018-01-01

Publisher

Academic Publications Ltd.

Subject

Color classes; Rainbow neighbourhood; Rainbow neighbourhood number

Coverage

Sudev N.K., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, 560029, India; Susanth C., Department of Mathematics, Vidya Academy of Science and Technology Thalakkottukara, Thrissur, 680501, India; Kalayathankal S.J., Department of Mathematics, Kuriakose Elias College, Mannanam, Kottayam, 686561, India

Rights

All Open Access; Gold Open Access; Green Open Access

Relation

ISSN: 13111728

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.12732/ijam.v31i6.8

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85067694169&doi=10.12732%2fijam.v31i6.8&partnerID=40&md5=ae27172df860779e1d771dff92cbbcdb