The purpose of this study is to develop rainbow antimagic coloring. This study is a combination of two notions, namely antimagic and rainbow concept. If every vertex of graph G is labeled with the antimagic labels and then edge weight of antimagic labels are used to assign a rainbow coloring. The minimum number of colors for a rainbow path to exist with the condition satisfying the edge weights w(x) ≠ w(y) for any two vertices x and y is the definition of the rainbow antimagic connection number rac(G). In this study, we use connected graphs and simple graphs in obtaining the rainbow antimagic connection number. This paper will explain the rainbow antimagic coloring on some graphs and get their formula of the rainbow antimagic connection number. We have obtained rac(G) where G is vertex amalgamation of graphs, namely path, star, broom, paw, fan, and triangular book graph.