Publication: On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
Date
Authors
Cangül, İsmail Naci
Authors
Deepa, T.
Venkatachalam, M.
Advisor
Language
Type
Publisher:
World Scientific Publ Co Pte Ltd
Journal Title
Journal ISSN
Volume Title
Abstract
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that vertical bar c(N(v))vertical bar >= min{r,d(v)} for each vertex v is an element of V(G). The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of brick product graphs.
Description
Source:
Keywords:
Keywords
R-dynamic coloring, Brick product graph, Science & technology, Physical sciences, Mathematics