r-Chromatic Number On r-Dynamic Vertex Coloring of Comb Graph

• Published in: Jurnal Matematika, Statistika dan Komputasi Vol. 20; no. 2; pp. 360 - 370
• Main Authors: Sari, Heryati Nur Fatimah, Nurwahyu, Budi, Massalesse, Jusmawati
• Format: Journal Article
• Language: English
• Published: 24.12.2023
• ISSN: 1858-1382; 2614-8811
• DOI: 10.20956/j.v20i2.32143

Let  be a graph with vertex set  and edge set . An r-dynamic vertex coloring of a graph  is a assigning colors to the vertices of  such that for every vertex  receives at least  colors in its neighbors. The minimum color used in r-dynamic vertex coloring of graph  is called the r-dynamic chromatic number denoted as . In this research we well determine the coloring pattern and the r-dynamic chromatic number of the comb graph , central graph of comb graph , middle graph of comb graph , line graph of comb graph , sub-division graf of comb graph , and para-line graph of comb graph Let  be a graph with vertex set  and edge set . An r-dynamic vertex coloring of a graph  is a assigning colors to the vertices of  such that for every vertex  receives at least  colors in its neighbors. The minimum color used in r-dynamic vertex coloring of graph  is called the r-dynamic chromatic number denoted as . In this research we well determine the coloring pattern and the r-dynamic chromatic number of the comb graph , central graph of comb graph , middle graph of comb graph , line graph of comb graph , sub-division graf of comb graph , and para-line graph of comb graph