%0 Journal Article %1 noauthororeditor %A Yenoke, Kins %D 2020 %J International Journal of Trend in Scientific Research and Development %K Circulant Computational Labelling Radio Science graphs labelling number %N 5 %P 430-434 %T On the Radio Number of Certain Classes of Circulant Graphs %U https://www.ijtsrd.com/mathemetics/computational-science/31865/on-the-radio-number-of-certain-classes-of-circulant-graphs/kins-yenoke %V 4 %X Radio labelling problem is a special type of assignment problem which maximizes the number of channels in a specified bandwidth. A radio labelling of a connected graph G= V,E is an injection h V G N such that d x,y |f x f y | =1 d G x,y V G , where d G is the diameter of the graph G. The radio number of h denoted rn h , is the maximum number assigned to any vertex of G. The radio number of G, denoted rn G , is the minimum value of rn h taken over all labelling’s h of G. In this paper we have obtained the radio number certain classes of circulant graphs, namely G n 1,2… n 2 1 ,G n 1,n 2 ,G n 1,n 3 and G n 1,n 5 . Kins Yenoke Ön the Radio Number of Certain Classes of Circulant Graphs" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-5 , August 2020, URL: https://www.ijtsrd.com/papers/ijtsrd31865.pdf Paper Url :https://www.ijtsrd.com/mathemetics/computational-science/31865/on-the-radio-number-of-certain-classes-of-circulant-graphs/kins-yenoke

@article{noauthororeditor, abstract = {Radio labelling problem is a special type of assignment problem which maximizes the number of channels in a specified bandwidth. A radio labelling of a connected graph G= V,E is an injection h V G N such that d x,y |f x f y | =1 d G x,y V G , where d G is the diameter of the graph G. The radio number of h denoted rn h , is the maximum number assigned to any vertex of G. The radio number of G, denoted rn G , is the minimum value of rn h taken over all labelling’s h of G. In this paper we have obtained the radio number certain classes of circulant graphs, namely G n {1,2… n 2 1} ,G n {1,n 2} ,G n {1,n 3} and G n {1,n 5} . Kins Yenoke "On the Radio Number of Certain Classes of Circulant Graphs" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-5 , August 2020, URL: https://www.ijtsrd.com/papers/ijtsrd31865.pdf Paper Url :https://www.ijtsrd.com/mathemetics/computational-science/31865/on-the-radio-number-of-certain-classes-of-circulant-graphs/kins-yenoke }, added-at = {2020-09-15T13:13:59.000+0200}, author = {Yenoke, Kins}, biburl = {https://www.bibsonomy.org/bibtex/2abbeadf5a9c192446daad8989e3a6df7/ijtsrd}, interhash = {66b06e691b959c073aa239970d036a8b}, intrahash = {abbeadf5a9c192446daad8989e3a6df7}, issn = {2456-6470}, journal = {International Journal of Trend in Scientific Research and Development}, keywords = {Circulant Computational Labelling Radio Science graphs labelling number}, language = {English}, month = jul, number = 5, pages = {430-434}, timestamp = {2020-09-15T13:13:59.000+0200}, title = {On the Radio Number of Certain Classes of Circulant Graphs }, url = {https://www.ijtsrd.com/mathemetics/computational-science/31865/on-the-radio-number-of-certain-classes-of-circulant-graphs/kins-yenoke}, volume = 4, year = 2020 }