On graceful chromatic number of some graphs

Dafik, Dafik; Agustin, Ika Hesti; Nisviasari, Rosanita; Adawiyah, Robiatul

doi:10.1088/1742-6596/2157/1/012013

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 6 publications

(6 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, in 2022, Asy'ari et al in [2] presented graceful chromatic numbers of several types of graphs, including star graphs, diamond graphs, book graphs. In addition, Asy'ari, et al also stated some open problems.…”

Section: Introductionmentioning

confidence: 99%

Graceful Chromatic Number of Some Cartesian Product Graphs

Suparta,

Venkatachalam,

Gunadi

et al. 2023

UMJ

View full text Add to dashboard Cite

A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that \(f(u)\neq f(v)\) for every edge \(uv\in E(G)\). Moreover, if \(|f(u)-f(v)|\neq |f(v)-f(w)|\) for every adjacent edges \(uv,vw\in E(G)\), then the function \(f\) is called graceful colouring for \(G\). The minimum number \(k\) such that \(f\) is a graceful colouring for \(G\) is called the graceful chromatic number of \(G\). The purpose of this research is to determine graceful chromatic number of Cartesian product graphs \(C_m \times P_n\) for integers \(m\geq 3\) and \(n\geq 2\), and \(C_m \times C_n\) for integers \(m,n\geq 3\). Here, \(C_m\) and \(P_m\) are cycle and path with \(m\) vertices, respectively. We found some exact values and bounds for graceful chromatic number of these mentioned Cartesian product graphs.

show abstract

Section: Introductionmentioning

confidence: 99%