<![CDATA[The graph G is a pair of sets consisting of a vertex set V(G) and an edge set E(G), denoted by G = (V (G),E(G)). Coloring a graph involves assigning colors to each vertex, edge, or region such that no adjacent vertices, edges, or regions share the same color. A bijective function f∶ V (G) → {1,2,3,...,|V (G)|} is called a local edge antimagic coloring if for any two adjacent edges e_1 and e_2, they have different weights, w(e_1) ≠ w(e_2), where e = uv ∈ E(G) and w(e) = f (u)+f (v). The chromatic number is the term used in the context of local antimagic coloring, referring to the minimum number of colors derived from local antimagic labeling. This research discusses the local antimagic edge coloring on the Gear Graph (G_n) and the Semi Parachute Graph (SP_(2n-1)). The aim of the research is to determine the chromatic number of local antimagic edge coloring χlea(G) for the researched graphs. The method used in this research is pattern detection to derive the general pattern. Based on the analysis, the chromatic number of local antimagic edge coloring is obtained for the Gear Graph (G_n) and the Semi Parachute Graph (SP_(2n-1)) are χlea (G_n)=n + 2 and χlea(SP_(2n-1) )=n+ 2.]]>
Copyrights © 2025
