| Abstrakt: |
Let G be a simple graph. For a bijective function f : V (G) → {1, 2, 3, ..., V (G)}, the edge weight for any uv ∈ E(G) under f is wf (uv) = f (u) + f (v). A path P in a graph G is said to be a rainbow path, if for every two edges uv, u′v′ ∈ E(P), the edge weight satisfies wf (uv) ≠ wf (u′v′). If for every two vertices u and v of G, there exists a rainbow path u˘v, then f is called a rainbow antimagic coloring of graph G. The minimum number of colors induced by all edge weights required is called rainbow antimagic connection number, denoted by (rac(G)). In this paper, we will study the exact values of the rainbow antimagic connection number of some specific family of graphs. We will determine rac(G) where G is amalgamation of graphs, namely jahangir graph J2,n, flowerpot graph C3Sn, bull graph Bl, and volcano graph Vor, z, t. [ABSTRACT FROM AUTHOR] |
