<abstract xmlns="http://www.w3.org/1999/xhtml"><p>A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class of G consists of at least one vertex from the closed neighbourhood N[v]. A maximal proper coloring of a graph G is a J-coloring if and only if every vertex of G belongs to a rainbow neighbourhood of G. In general all graphs need not have a J-coloring, even though they admit a chromatic coloring. In this paper, we characterise graphs which admit a J-coloring. We also discuss some preliminary results in respect of certain graph operations which admit a J-coloring under certain conditions.</p></abstract>

A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class of G consists of at least one vertex from the closed neighbourhood N[v]. A maximal proper coloring of a graph G is a J-coloring if and only if every vertex of G belongs to a rainbow neighbourhood of G. In general all graphs need not have a J-coloring, even though they admit a chromatic coloring. In this paper, we characterise graphs which admit a J-coloring. We also discuss some preliminary results in respect of certain graph operations which admit a J-coloring under certain conditions.

J-coloring of graph operations

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"J-coloring of graph operations"}

A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class of G consists of at least one vertex from the closed...

J-coloring of graph operations

Publicado en línea: 21 ago 2019

Páginas: 95 - 108

Recibido: 04 jul 2019

DOI: https://doi.org/10.2478/ausi-2019-0007

Palabras clave
rainbow neighbourhood, J-coloring, J*-coloring

© 2019 Sudev Naduvath et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

J-coloring of graph operations

Publicado en línea: 21 ago 2019

Páginas: 95 - 108

Recibido: 04 jul 2019

DOI: https://doi.org/10.2478/ausi-2019-0007

Palabras claverainbow neighbourhood, J-coloring, J*-coloring

© 2019 Sudev Naduvath et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Palabras clave
rainbow neighbourhood, J-coloring, J*-coloring