E-resources
PDF-
Asy’ari, M L; Dafik; Agustin, I H; Nisviasari, R; Adawiyah, R
Journal of physics. Conference series, 01/2022, Volume: 2157, Issue: 1Journal Article
Abstract We examine that all graphs in this paper are limited, simple and connected. A graceful k -coloring of a graph is a proper vertex coloring f 1 : V ( G ) → {1, 2,…, k } where k ≥ 2 which induces a proper edge coloring f 2 : E ( G ) → {1, 2,…, k − 1} characterized by f 2 ( uυ ) = | f 1 ( u ) — f 2 ( υ )|. Nethermost k for which a graph G has a graceful k -coloring is named a graceful chromatic number of a graph G , denoted by χ g ( G ). In our research, we will obtain the exact value of the graceful chromatic number of some graphs.
