2017/08/09 by Federico Fornasiero, Sudev Naduvath, Fornasiero, Federico +1
Mathematics · #05C15 #05C38 #05C75 #FOS: Mathematics #General Mathematics (math.GM) #math.GM #msc:05C15 #msc:05C38 #msc:05C75
paper · pdf · doi:10.48550/arxiv.1708.09798
12 pages, 8 figures
arxiv created 2017/09/04 · arxiv updated 2017/09/05
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 colour class of G with respect to C. A maximal proper colouring of a graph G is a J-colouring of G if and only if every vertex of G belongs to a rainbow neighbourhood of G. In this paper, we study certain parameters related to J-colouring of certain Mycielski type graphs.