On the k-neighborhood coloring of the corona and join products of graphs

A graph G has a k -neighborhood coloring, if there exists a coloring in which for each vertex of G, say v, the sum of the coloring of vertices in N(v) modulo k be non-zero. In this paper we prove that every corona and join product of two graphs has a k -neighborhood coloring for every k ≥ 3. Moreove...

Full description

Saved in:
Bibliographic Details
Published inJournal of information & optimization sciences Vol. 40; no. 3; pp. 805 - 811
Main Authors Alikhani, Saeid, Soltani, Samaneh, Rajasingh, Indra
Format Journal Article
LanguageEnglish
Published Taylor & Francis 03.04.2019
Subjects
Corona
Graph
Join
Neighborhood coloring
Online AccessGet full text

Cover

More Information
Summary:A graph G has a k -neighborhood coloring, if there exists a coloring in which for each vertex of G, say v, the sum of the coloring of vertices in N(v) modulo k be non-zero. In this paper we prove that every corona and join product of two graphs has a k -neighborhood coloring for every k ≥ 3. Moreover, we provide some examples showing that there exists some corona and join graphs which do not have 2-neighborhood coloring.
ISSN:0252-2667
2169-0103
DOI:10.1080/02522667.2019.1569824