Rasmin Siringo-ringo
Universitas Pendidikan Ganesha

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Graceful Chromatic Numbers of Three Variants of Triangular Ladder Graphs Raphita Yanisari Silalahi; I Nengah Suparta; Sariyasa Sariyasa; Rasmin Siringo-ringo; Kadek Ria Andriani
Venn: Journal of Sustainable Innovation on Education, Mathematics and Natural Sciences Vol. 5 No. 5 (2026): Volume 5 Nomor 5 Tahun 2026
Publisher : Pusat Studi Bahasa dan Publikasi Ilmiah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53696/venn.v5i5.682

Abstract

A graceful k-coloring of a graph G is a proper vertex coloring f: V(G) → {1, 2, ..., k}, where k ≥ 2, which induces a proper edge coloring f*: E(G) → {1, 2, ..., k − 1}, defined by f*(uv) = |f(u) − f(v)| for every edge uv ∈ E(G). The graceful chromatic number of G, denoted by chi_g(G), is the minimum integer k for which G admits a graceful k-coloring. This study determines the graceful chromatic numbers of the variation triangular ladder graph, the bridge triangular ladder graph, and the circular triangular ladder graph.