Browsing by Subject "graceful chromatic number"
Now showing items 1-1 of 1
-
on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
(CAUCHY –Jurnal Matematika Murni dan Aplikasi, 2022-08-13)Definition graceful k-coloring of graph 𝐺 = (𝑉, 𝐸) is proper vertex coloring 𝑐: 𝑉(𝐺) → {1,2, … , 𝑘); 𝑘 ≥ 2, which induces a proper edge coloring 𝑐′: 𝐸(𝐺) → {1,2, … , 𝑘 − 1} defined 𝑐 ′ (𝑢𝑣) = |𝑐(𝑢) − ...