Browsing by Subject "r-dynamic coloring"
Now showing items 1-3 of 3
-
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 r-dynamic vertex coloring of some flower graph families
(World Scientific Publishing Company, 2021-03-03)e a simple, connected undirected graph with m vertices and n edges. Let ver tex coloring c of a graph G be a mapping c : V (G) → S, where |S| = k and it is k-colorable. Vertex coloring is proper if none of the any two ... -
The r-Dynamic Local Irregularity Vertex Coloring of Graph
(INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019, 2019-07-01)We define the r-dynamic local irregularity vertex coloring. Suppose : V(G) {1,2, … , k} is called vertex irregular k-labeling and w : V(G) N where 𝑤(𝑢) = ∑ (𝑣) . is called r-dynamic local irregular vertex ...