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

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

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...

Full description

Bibliographic Details
Main Authors: Agustin, Ika Hesti, Dafik, Dafik, Nisviasari, Rosanita, Baihaki, Rifki Ilham, Kurniawati, Elsa Yuli, Husain, Sharifah Kartini Said, Nagaraja, Vaishnavi
Format: Article
Language:English
Published: Natural Sciences Publishing 2024
Online Access:http://psasir.upm.edu.my/id/eprint/112470/
http://psasir.upm.edu.my/id/eprint/112470/1/js5241km6556q7.pdf

Similar Items

Similar Items