Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph
Keywords:Cycle graph, rainbow vertex, antimagic coloring, rainbow vertex antimagic connection number, modified affine cipher, cryptosystem
An edge labeling of graph G is a function g from the edge set of graph G to the first natural numbers up to the number of the edge set. Graph G 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 G is assigned by vertex weight. The vertex weight of graph G is obtained by summing all edge labels that incident with that vertex. The rainbow vertex antimagic connection number of graph G, denoted by rvac(G) 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 (rvac) on a cycle graph (Cn) and create a secured cryptosystem using a modified Affine Cipher based on rainbow vertex antimagic coloring.
G. Chartrand, L. Lesniak, and P. Zhang, Graphs & Digraphs, Fifth Edition. 2010.
M. Krivelevich and R. Yuster, “The rainbow connection of a graph is (at most) reciprocal to its minimum degree,” J. Graph Theory, vol. 63, pp. 185–191, 2010.
D. N. S. Simamora and A. N. M. Salman, “The Rainbow (Vertex) Connection Number of Pencil Graphs,” Procedia Comput. Sci., vol. 74, pp. 138–142, 2015, doi: 10.1016/j.procs.2015.12.089.
G. Chartrand, G. L. Johns, K. A. McKeon, and P. Zhang, “Rainbow connection in graphs,” Math. Bohem., vol. 133, pp. 85–98, 2008.
G. Chartrand, G. L. Johns, K. A. McKeon, and P. Zhang, “The rainbow connectivity of a graph,” Networks, 2009, doi: 10.1002/net.20296.
Dafik, I. H. Agustin, A. Fajariyato, and R. Alfarisi, “On the rainbow coloring for some graph operations,” vol. 020004, 2016, doi: 10.1063/1.4940805.
X. Li and Y. Sun, “An Updated Survey on Rainbow Connections of Graphs- A Dynamic Survey,” Theory Appl. Graphs, 2017, doi: 10.20429/tag.2017.000103.
M. S. Hasan, Slamin, Dafik, I. H. Agustin, and R. Alfarisi, “On the total rainbow connection of the wheel related graphs,” 2018.
P. Heggernes, D. Issac, J. Lauri, P. T. Lima, and E. J. Van Leeuwen, “Rainbow vertex coloring bipartite graphs and chordal graphs,” Leibniz Int. Proc. Informatics, LIPIcs, vol. 117, no. 83, pp. 1–13, 2018, doi: 10.4230/LIPIcs.MFCS.2018.83.
Dafik, Slamin, and A. Muharromah, “On the ( Strong ) Rainbow Vertex Connection of Graphs Resulting from Edge Comb Product,” 2018.
B. J. Septory, M. I. Utoyo, Dafik, B. Sulistiyono, and I. H. Agustin, “On rainbow antimagic coloring of special graphs,” J. Phys. Conf. Ser., vol. 1836, no. 1, 2021, doi: 10.1088/1742-6596/1836/1/012016.
Marsidi, I. H. Agustin, Dafik, and E. Y. Kurniawati, “On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion,” CAUCHY – J. Mat. Murni dan Apl., vol. 7, no. 1, pp. 64–72, 2021.
Dafik, F. Susanto, R. Alfarisi, I. H. Agustin, and M. Venkatachalam, “On Rainbow Antimagic Coloring Of Graphs,” Adv. Math. Model. Appl., vol. 6, no. 3, pp. 278–291, 2021.
H. S. Budi, Dafik, I. M. Tirta, I. H. Agustin, and A. I. Kristiana, “On rainbow antimagic coloring of graphs,” J. Phys. Conf. Ser., vol. 1832, no. 1, 2021, doi: 10.1088/1742-6596/1832/1/012016.
A. C. Prihandoko, D. Dafik, and I. H. Agustin, “Implementation of super H-antimagic total graph on establishing stream cipher,” Indones. J. Comb., vol. 3, no. 1, p. 14, 2019, doi: 10.19184/ijc.2019.3.1.2.
A. C. Prihandoko, Dafik, and I. H. Agustin, “Stream-keys generation based on graph labeling for strengthening Vigenere encryption,” Int. J. Electr. Comput. Eng., vol. 12, no. 4, pp. 3960–3969, 2022, doi: 10.11591/ijece.v12i4.pp3960-3969.
How to Cite
Copyright (c) 2022 Marsidi Marsidi
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work