Key Generation in Cryptography Using Radio Path Coloring
Dhanyashree,
K. N. Meera,
Said Broumi
Abstract:An L(p 1 , p 2 , p 3 , . . . , p m )labeling of a graph G is an assignment of positive integers to the vertices of G such that the difference in the labels assigned to the vertices at distance i should be at least p i . The particular case of p 1 = d, p 2 = d − 1, p 3 = d − 2, . . . , p d = 1 where d is the diameter of the graph, was known as the radio labeling of G. The minimum value of the maximum integer used in any feasible radio labeling of G was called as radio number of G denoted by rn(G). The idea of r… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.