Radio Labelings of Lexicographic Product of Some Graphs

Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different channel assignments is maintained. It enhances the graph terminologies for the computer programs. In this paper, we will discuss multidistance radio labeling used for channel assignment problems over wireless communication. A radio labeling is a one-to-one mapping P:V(G) ? DOUBLE-STRUCK CAPITAL Z(+) satisfying the condition |P(mu)-P(mu)& PRIME;|& GE;diam(G)+1-d(mu,mu & PRIME;):mu,mu & PRIME;& ISIN;V(G) for any pair of vertices mu,mu & PRIME; in G. The span of labeling P is the largest number that P assigns to a vertex of a graph. Radio number of G, denoted by rn(G), is the minimum span taken over all radio labelings of G. In this article, we will find relations for radio number and radio mean number of a lexicographic product for certain families of graphs.