On rainbow antimagic coloring of special graphs

B. J. Septory, M. I. Utoyo, Dafik, B. Sulistiyono, I. H. Agustin

Research output: Contribution to journalConference articlepeer-review

6 Citations (Scopus)

Abstract

Let G(V, E) be a connected, undirected and simple graph with vertex set V(G) and edge set E(G). A labeling of a graph G is a bijection f from V(G) to the set {1, 2,..., | V(G)|}. The bijection f is called rainbow antimagic vertex labeling if for any two edge uv and u'v' in path x-y,w(uv) = w(u'v') w(uv), where w(uv) = f (u) + f (v) and x,y ? V(G). A graph G is a rainbow antimagic connection if G has a rainbow antimagic labeling. Thus any rainbow antimagic labeling induces a rainbow coloring of G where the edge uv is assigned with the color w(uv). The rainbow antimagic connection number of G, denoted by rac(G), is the smallest number of colors taken over all rainbow colorings induced by rainbow antimagic labeling of G. In this paper, we show the exact value of the rainbow antimagic connection number of jahangir graph J2,m, lemon graph Lem, firecracker graph (Fm,3), complete bipartite graph (K2,m), and double star graph (Sm,m).

Original languageEnglish
Article number012016
JournalJournal of Physics: Conference Series
Volume1836
Issue number1
DOIs
Publication statusPublished - 23 Mar 2021
Event4th International Conference on Combinatorics, Graph Theory, and Network Topology, ICCGANT 2020 - Jember, East Java, Indonesia
Duration: 22 Aug 202023 Aug 2020

Fingerprint

Dive into the research topics of 'On rainbow antimagic coloring of special graphs'. Together they form a unique fingerprint.

Cite this