Search
Now showing items 1-2 of 2
The Lower Bound of the r-Dynamic Chromatic Number of Corona Product by Wheel Graphs
(AIP Conf. Proc. 2014, 020054-1–020054-7, 2018-09-21)
The dynamic coloring of a graph G is proper coloring such that every vertex of G with degree has at least two
neighbors that are colored differently. A generalization of the dynamic coloring was also introduced by Montgomery ...
On the r-Dynamic Chromatic Number of the Corronation by Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033, 2018-04-27)
In this paper we will study the r-dynamic chromatic number of the coronation
by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v
receive at least minfr; d(v)g di®erent colors. The ...