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...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Vasyl Stefanyk Precarpathian National University
2021-06-01
|
| Серія: | Karpatsʹkì Matematičnì Publìkacìï |
| Предмети: | |
| Онлайн доступ: | https://journals.pnu.edu.ua/index.php/cmp/article/view/3918 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|