TY - JOUR

T1 - Local Antimagic Chromatic Number of Super Star Graph

AU - Fitrialita, Indah

AU - Barack, Zeveliano Zidane

AU - Setiawan, Eunike

AU - Silaban, Denny Riama

N1 - Publisher Copyright:
© 2024 American Institute of Physics Inc.. All rights reserved.

PY - 2024/7/30

Y1 - 2024/7/30

N2 - Let G(V, E) be a graph with the vertex set V and edge set E. The local antimagic labeling of G with |E| edges is defined as a bijective function f: E → {1,2, …, |E|} such that w u) ≠ w(v) for any adjacent vertices uv ∈ E, where w(u) = Se?E(u)f(e) and E(u) is the set of edges incident to u. A local antimagic chromatic number of G is the minimum number of colors induced by the local antimagic labeling of G. A super star graph is a graph obtained by identifying a leaf from n star of order m for n and m are integer. In this article, we determine the local antimagic chromatic number of the super star graph.

AB - Let G(V, E) be a graph with the vertex set V and edge set E. The local antimagic labeling of G with |E| edges is defined as a bijective function f: E → {1,2, …, |E|} such that w u) ≠ w(v) for any adjacent vertices uv ∈ E, where w(u) = Se?E(u)f(e) and E(u) is the set of edges incident to u. A local antimagic chromatic number of G is the minimum number of colors induced by the local antimagic labeling of G. A super star graph is a graph obtained by identifying a leaf from n star of order m for n and m are integer. In this article, we determine the local antimagic chromatic number of the super star graph.

UR - http://www.scopus.com/inward/record.url?scp=85200665825&partnerID=8YFLogxK

U2 - 10.1063/5.0222521

DO - 10.1063/5.0222521

M3 - Conference article

AN - SCOPUS:85200665825

SN - 0094-243X

VL - 3176

JO - AIP Conference Proceedings

JF - AIP Conference Proceedings

IS - 1

M1 - 020008

T2 - 7th International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2023

Y2 - 21 November 2023 through 22 November 2023

ER -