Radio Graceful Labelling of Graphs

Authors

Laxman Saha, Balurghat CollegeFollow
Alamgir Rahaman BasuniaFollow

Abstract

Radio labelling problem of graphs have their roots in communication problem known as Channel Assignment Problem. For a simple connected graph G=(V(G), E(G)), a radio labeling is a mapping f : V(G) →{0,1,2,…} such that |f(u)-f(v)|≥ diam(G)+1-d(u,v) for each pair of distinct vertices u,v ∈ V(G), where diam(G) is the diameter of G and d(u,v) is the distance between u and v. A radio labeling f of a graph G is a radio graceful labeling of G if f(V(G)) = {0,1,… |V(G)|-1}. A graph for which a radio graceful labeling exists is called radio graceful. In this article, we study radio graceful labeling for general graphs in terms of some new parameters.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Saha, Laxman and Basunia, Alamgir Rahaman (2020) "Radio Graceful Labelling of Graphs," Theory and Applications of Graphs: Vol. 7: Iss. 1, Article 7.
DOI: 10.20429/tag.2020.070107
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol7/iss1/7