Browsing by Subject "r-dynamic chromatic number"
Now showing items 1-7 of 7
-
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 r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs
(International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017], 2017-04-09)This study is a natural extension of k -proper coloring of any simple and connected graph G. By a n rdynamic coloring of a graph G, we mean a proper k coloring of graph G such that the neighbors of any vert ... -
On r-dynamic coloring of some graph operations
(2018-03-07)Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j minfr; d(v)g for each vertex v in ... -
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 ... -
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 ... -
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 ... -
Several classes of graphs and their r-dynamic chromatic numbers
(2018-02-28)Let G be a simple, connected and undirected graph. Let r; k be natural numbers. By a proper k-coloring of a graph G, we mean a map c : V (G) ! S, where jSj = k, such that any two adjacent vertices receive di erent colors. ...