Home > Mathemetics > Computational Science > Volume-4 > Issue-5 > On the Radio Number of Certain Classes of Circulant Graphs

### On the Radio Number of Certain Classes of Circulant Graphs

#### Call for Papers

Volume-8 | Issue-2

Last date : 26-Apr-2024

Best International Journal
Open Access | Peer Reviewed | Best International Journal | Indexing & IF | 24*7 Support | Dedicated Qualified Team | Rapid Publication Process | International Editor, Reviewer Board | Attractive User Interface with Easy Navigation

Journal Type : Open Access

First Update : Within 7 Days after submittion

#### Research Area

 Engineering Pharmacy Management Biological Science Other Scientific Research Area Humanities and the Arts Chemistry Physics Medicine Mathemetics Economics Computer Science Home Science

On the Radio Number of Certain Classes of Circulant Graphs

Kins Yenoke

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, pp.430-434, URL: https://www.ijtsrd.com/papers/ijtsrd31865.pdf

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} ).