Rainbow degree-jump coloring of graphs

In this paper, we introduce a new notion called the rainbow degree-jump coloring of a graph. For a vertex $v\in V(G)$, let the degree-jump closed neighbourhood of a vertex $v$ be defined as $N_{deg}[v] = \{u:d(v,u)\leq d(v)\}.$ A proper coloring of a graph $G$ is said to be a rainbow degree-jump col...

Full description

Bibliographic Details
Main Authors: E.G. Mphako-Banda, J. Kok, S. Naduvath
Format: Article
Language:English
Published: Vasyl Stefanyk Precarpathian National University 2021-06-01
Series:Karpatsʹkì Matematičnì Publìkacìï
Subjects:
Online Access:https://journals.pnu.edu.ua/index.php/cmp/article/view/3918