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

被引：0

作者：

Alikhani, Saeid ^{[1
]}

Soltani, Samaneh ^{[1
]}

Rajasingh, Indra ^{[2
]}

机构：

[1] Yazd Univ, Dept Math, Yazd 89195741, Iran

[2] Vellore Inst Technol, Chennai 600127, Tamil Nadu, India

来源：

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2019年 / 40卷 / 03期

关键词：

Graph; Neighborhood coloring; Corona; Join;

D O I：

10.1080/02522667.2019.1569824

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

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.

引用

页码：805 / 811

页数：7