Radio Mean Labeling of Arrow Graph and its related graphs

A labeling is assigning non-negative numbers to the vertices and edges. Radio Mean labeling of a connected graph \(I\) is a one-to-one mapping \(g:V(I)\to N\) such that for any vertices \(p\) and \(q\) of graph \(I\), \(d(p,q)+\lceil f(p)+f(q)/2\rceil \ge 1+diam(I)\). In the present research, we have investigated the labeling, which applied in the field of networking, optimization and many more. We have also found the Radio Mean Number of the function \('g'\) obtained from the graph \(I\). The above-mentioned concepts are of great significance for their application in computer science and related fields.