Search
Now showing items 1-2 of 2
r-Dynamic Coloring of the Corona Product of Graphs
(Discrete Mathematics, Algorithms and Applications Vol. 12, No. 2 (2020) 2050019, 2020-01-21)
Let G = (V, E) be a graph. A proper k-coloring of graph G is r-dynamic coloring if
for every v, the neighbors of vertex v receive at least min
{
r, d(v)
}
different colors. The
minimum k such that graph G has r-dynamic ...
On the r-Dynamic Chromatic Numberof Corona Product of Star Graph
(Thai Journal of Mathematics, 2022-10-01)
A proper k coloring of graph G such that the neighbors of any vertex v ∈ V (G) where at least min{r, d(v)} different colors is defined an r-dynamic coloring. The minimum k such that graph G has an r-dynamic k coloring is ...