@article{B. Sooryanarayana, Ramya, M. Vishu Kumar_2020, title={On Radio Graceful Labeling of a Graph}, volume={29}, url={http://sersc.org/journals/index.php/IJAST/article/view/8734}, abstractNote={<p><em>For a graph </em> <em>, a radio labeling is a function</em> <em> such that </em> <em>, for all </em> <em>. The radio number </em> <em>of a radio labeling f ofG is the maximum label assigned to a vertex of G. The radio number of G denoted by </em> <em>is </em> <em>taken over all radio labelingf of G. A graph G is said to be radio graceful if it has a radio labeling with </em> <em>. In this paper we obtain the necessary condition for a graph G with n vertices to be radio graceful and characterize the radio graceful graphs with </em> <em>.</em></p>}, number={6s}, journal={International Journal of Advanced Science and Technology}, author={B. Sooryanarayana, Ramya, M. Vishu Kumar}, year={2020}, month={Apr.}, pages={108 - 114} }