TY - JOUR AU - Marsidi, Marsidi PY - 2022/12/01 Y2 - 2024/03/28 TI - Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph JF - Jurnal Matematika MANTIK JA - J. Mat. Mantik VL - 8 IS - 2 SE - Articles DO - 10.15642/mantik.2022.8.2.78-88 UR - https://jurnalsaintek.uinsby.ac.id/index.php/mantik/article/view/1553 SP - 78-88 AB - <p>An edge labeling of graph <em>G</em> is a function <em>g</em> from the edge set of graph <em>G</em> to the first natural numbers up to the number of the edge set. Graph <em>G</em> admits a rainbow vertex antimagic coloring if, for any two vertices, there is a path with different colors of all internal vertices. The vertex color of graph <em>G</em> is assigned by vertex weight. The vertex weight of graph <em>G</em> is obtained by summing all edge labels that incident with that vertex. The rainbow vertex antimagic connection number of graph <em>G</em>, denoted by <em>rvac(G)</em> is the smallest number of different colors induced by rainbow vertex antimagic coloring. In this research, we determine the upper bound of the rainbow vertex antimagic connection number (<em>rvac</em>)  on a cycle graph (<em>Cn</em>) and create a secured cryptosystem using a modified Affine Cipher based on rainbow vertex antimagic coloring.</p> ER -