Browse > Article
http://dx.doi.org/10.14317/jami.2015.173

RADIO AND RADIO ANTIPODAL LABELINGS FOR CIRCULANT GRAPHS G(4k + 2; {1, 2})  

Nazeer, Saima (Department of Mathematics, Lahore College for Women University)
Kousar, Imrana (Department of Mathematics, Lahore College for Women University)
Nazeer, Waqas (Department of Mathematics, University of Education Township Lahore)
Publication Information
Journal of applied mathematics & informatics / v.33, no.1_2, 2015 , pp. 173-183 More about this Journal
Abstract
A radio k-labeling f of a graph G is a function f from V (G) to $Z^+{\cup}\{0\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}k+1$ for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices $x,y{\in}G$. The span of a radio k-labeling f is denoted by sp(f) and defined as max$\{{\mid}f(x)-f(y){\mid}:x,y{\in}V(G)\}$. The radio k-labeling is a radio labeling when k = diam(G). In other words, a radio labeling is an injective function $f:V(G){\rightarrow}Z^+{\cup}\{0\}$ such that $${\mid}f(x)=f(y){\mid}{\geq}diam(G)+1-d(x,y)$$ for any pair of vertices $x,y{\in}G$. The radio number of G denoted by rn(G), is the lowest span taken over all radio labelings of the graph. When k = diam(G) - 1, a radio k-labeling is called a radio antipodal labeling. An antipodal labeling for a graph G is a function $f:V(G){\rightarrow}\{0,1,2,{\ldots}\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}diam(G)$ holds for all $x,y{\in}G$. The radio antipodal number for G denoted by an(G), is the minimum span of an antipodal labeling admitted by G. In this paper, we investigate the exact value of the radio number and radio antipodal number for the circulant graphs G(4k + 2; {1, 2}).
Keywords
diameter; radio number; radio antipodal number; circulant graphs;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. Chartrand, L. Nebesk'y and P. Zhang, Radio k-colorings of paths, Discussiones Mathematicae Graph Theory, 24 (2004), 5-21.   DOI
2 G. Chartrand, D. Erwin, and P. Zhang, Radio antipodal colourings of cycles, Congressus Numerantium, 144 (2000), 129-141.
3 G. Chartrand, D. Erwin, and P. Zhang, Radio antipodal colourings of graphs, Math. Bohemica, 127 (2002), 57-69.
4 G. Chartrand, D. Erwin, and P. Zhang, and F. Harary, Radio labelings of grphs, Bull. Inst. Combin. appl., 33 (2001), 77-85.
5 W.K. Hale, Frequency assignment: theory and application, Proc IEEE, 68 (1980), 1497-1514.   DOI   ScienceOn
6 J.S. Juan and D.F. Liu, Antipodal labelings for cycles, Dec. 12, 2006 (Manuscript).
7 M. Kchikech, R. Khenoufa and O. Togni, Linear and cyclic radio k-labelings of trees, Discussiones Mathematicae Graph Theory, 27 (2007), 105-123.   DOI
8 M. Kchikech, R. Khenoufa and O. Togni, Radio k-labelings for cartesian products of graphs, Discussion Mathematicae Graph Theory.
9 R. Khennoufa and O. Togni, A note on radio antipodal colourings of paths, Math. Bohemica, 130 (2005), 277-282.
10 R. Khennoufa and O. Togni, The radio antipodal and radio numbers of the hypercube, Ars Combinatoria, 102 (2011), 447-461.
11 D. Liu and X. Zhu, Multi-level distance labelings for paths and cycles, SIAM J. Disc. Math., 19 (2005), 610-621.   DOI   ScienceOn
12 D. Liu and M. Xie, Radio number for square cycles, Congr. Numerantium, 169 (2004), 105-125.