On rainbow vertex antimagic coloring and its application to the encryption keystream construction

• المؤلفون الرئيسيون: Agustin, Ika Hesti, Dafik, Dafik, Nisviasari, Rosanita, Baihaki, Rifki Ilham, Kurniawati, Elsa Yuli, Husain, Sharifah Kartini Said, Nagaraja, Vaishnavi
• التنسيق: مقال
• اللغة: English
• منشور في: Natural Sciences Publishing 2024
• الوصول للمادة أونلاين: http://psasir.upm.edu.my/id/eprint/112470/1/js5241km6556q7.pdf; http://psasir.upm.edu.my/id/eprint/112470/; https://www.naturalspublishing.com/Article.asp?ArtcID=28665

Let G = (V,E) be a graph that is a simple, connected and un-directed graph. We now introduce a new notion of rainbow vertex antimagic coloring. This is a proper development of antimagic labeling with rainbow vertex coloring. The weight of a vertex v ∈ V(G) under f for f : E(G) → {1,2, …, |E(G)|} is...