Title: Graceful Coloring of Wheel Graph Family
Authors: Siti Khoirunnisa, Dafik, Arika Indah Kristiana, Ridho Alfarisi
Volume: 5
Issue: 4
Pages: 68-78
Publication Date: 4/28/2021//
Abstract:
All graph in this paper are connected and simple graph. A proper vertex coloring f:VG?{1, 2, ..., k}, where k=2 which induces a proper edge coloring f:EG?{1, 2, ..., k-1} define by f\'uv=|fu-fv| is called a graceful k -coloring. If f is a g