RADIO LABELING OF MYCIELSKIAN GRAPH OF CERTAIN GRAPHS

Abstract

For a connected graph , an injective function  such that for every distinct vertices  and  of ,  is called a radio labeling of . The radio number of ,  is the highest number assigned to any vertex of . The radio number of ,  is the minimum value of  taken over all radio labeling f of . The radio number for Mycielskian graph of Path graph, Mycielskian graph of Cycle graph and Mycielskian graph of Star graph  are obtained.