On graceful chromatic number of comb product of ladder graph
S Khoirunnisa, Dafik Dafik, Arika Indah Kristiana, Ridho Alfarisi, Ermita Rizki Albirri · Journal of Physics Conference Series · 2021
Abstract Let G be a connected and simple graph. Proper vertex colouring c : V(G) — {1, 2, 3,…, k} where k → 2 that induces a proper edge colouring c’ : E(G) — {1, 2, 3,…, k — 1} define by c’(uv)=|c(u) — c(v)|, where uv in E(G) is called graceful k— colouring. Graceful colouring is a vertex colouring c of graph G if c is a graceful k-coloring for some k ∈ N. Graceful chromatic number of a graph G, denoted by χβ (G) is the minimum k for which G has a graceful k—colouring. In our paper, we investigate the establish exact value of graceful chromatic number of comb product of ladder graph.