Abstract

A vertex v of a given graph G is said to be in a rainbow neighbourhood of G, with respect to a proper coloring C of G, if the closed neighbourhood N[v] of the vertex v consists of at least one vertex from every color class of G with respect to C. A maximal proper coloring of a graph G is a J-coloring of G such that every vertex of G belongs to a rainbow neighbourhood of G. In this paper, we study certain parameters related to J-coloring of certain Mycielski-type graphs.

Details

Title
On J-colorability of certain derived graph classes
Author
Fornasiero, Federico 1 ; Naduvath, Sudev 2 

 Department of Mathemathics, Universidade Federal de Pernambuco Recife, Pernambuco, Brazil 
 Department of Mathematics, CHRIST (Deemed to be University)Bangalore-560029, India 
Pages
159-173
Publication year
2019
Publication date
2019
Publisher
De Gruyter Poland
ISSN
18446086
e-ISSN
20667760
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
3155372962
Copyright
© 2019. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.