ON RADIO ANALYTIC MEAN D-DISTANCE NUMBER OF MORE GRAPHS

P. Poomalai, R. Vikramaprasad, P. Malliga

  DOI:  https://doi.org/10.37418/amsj.9.11.29

Full Text

A Radio Analytic Mean D-distance labeling of associated diagram $G$ is a balanced guide $v$ from the vertex set $V(G)$ to $N$ such that for two distinct vertices $u$ and $v$ of $G$. $d^D\left(u,v\right) +\left\lceil \frac{\left|f({u)}^2-f(v)^2\right|}{2}\right\rceil \ge 1+\ {diam}^{D\ }(G)$.

Keywords: Radio analytic mean D-distance, Fan graph, Double fan graph, flower graph, Helm graph, friendship graph, coconut tree, Jelly fish.