Jurnal Diferensial
Vol 6 No 1 (2024): April 2024

BILANGAN KROMATIK GRACEFUL PADA KELUARGA GRAF SENTRIPETAL

Deninta Dwi Ayu Lestari (Unknown)
Arika Indah Kristiana (Unknown)
Rafiantika Megahnia Prihandini (Unknown)
Ridho Alfarisi (Unknown)
Toto Bara Setiawan (Unknown)
Robiatul Adawiyah (Unknown)



Article Info

Publish Date
09 Feb 2024

Abstract

One of the topics studied in graphs is graph coloring. The definition of a graceful coloring, namely $k$-elegant coloring of a graph G is the exact vertex coloring c:V(G)→{ 1,2,...,k} where k≥2 induces the exact vertex coloring c^': V(G)→ {1,2,...,k-1} which is defined by c(uv)=|c(u)-c(v)|. The exact vertex coloring c of a graph G is a graceful coloring if c is a k-elegant coloring for k∈N. The graceful chromatic number is the minimum k value where graph G has k-elegant coloring, the elegant chromatic number of graph G is denoted by X_g (G). This article will discuss graceful chromatic numbers in the centripetal graph family which includes octopus graph (O_n), sandat graph (St_n),dutch windmill graph (D_3^m) , and a volcano graph (V_n).

Copyrights © 2024






Journal Info

Abbrev

JD

Publisher

Subject

Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Mathematics Public Health

Description

Jurnal Diferensial adalah jurnal sains yang bertujuan untuk menyebarluaskan hasil riset-riset ataupun kajian pustaka pada bidang ilmu matematika dan terapannya. Artikel-artikel pada jurnal ini difokuskan kepada bidang ilmu matematika dan terapannya. Ruang lingkup atau bidang ilmu yang diterima ...