On the r-dynamic chromatic number of subdivision of wheel graph

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.

Local Irregularity Point Coloring on the Result of Subdivision Operation of Helm Graphs

“…Daniel dan Taneo [1] menyebutkan bahwa graf digunakan untuk menggambarkan objek-objek diskrit dan keterkaitannya antar objek-objek tersebut. Suatu graf adalah himpunan titik dan sisi dengan himpunan titik merupakan himpunan kosong berhingga dan sisi merupakan himpunan berhingga (boleh kosong) dari pasangan titik [2][3][4][5][6].…”