Abstract
Let H be simple, non-isolated vertex, connected and directionless graphs with vertex set V (H), edge set E(H). With the use of c-coloring of graph H, using the formula c : υ(H) → S, where |S| = c, the colors of the adjacent vertex are different. A proper c-coloring of H is an r-dynamic coloring if it's applied to every vertex υ ∈ V (H) satisfies |c(N(υ))| ⩾ min {r, d(υ)}. The minimum c such that H has an r-dynamic coloring with c colors is called an r-dynamic chromatic number, denoted by χr (H). In this study, we will obtain the exact value of r-dynamic chromatic number of subdivision by wheel graph.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.