J. Comp. & Math. Sci. Vol.

2 (6), 868-872 (2011)

Radio Antipodal Number of Certain Graphs

ALBERT WILLIAM and CHARLES ROBERT KENNETH Department of Mathematics, Loyola College, Chennai, India ABSTRACT
Let , be a graph with vertex set and edge set . Let denote the diameter of and , denote the distance between the vertices and in . An antipodal labeling of with diameter is a function that assigns to each vertex , a positive integer , such that , | | , for all , . The span of an antipodal labeling is | |: , . The antipodal number for , denoted by , is the minimum span of all antipodal labelings of . Determining the antipodal number of a graph G is an NPcomplete problem. In this paper we determine the antipodal number of certain graphs. Keywords: Labeling, radio antipodal numbering, diameter.

1. INTRODUCTION Let G be a connected graph and let be an integer, 1. A radio -labeling of is an assignment of positive integers to the vertices of such that , | | 1 for every two distinct vertices and of , where , is the distance between any two vertices and of . The span of such a function , denoted by | |: , . Radio -labeling was motivated by the frequency assignment problem4. The maximum distance among all pairs of vetices in G is the diameter of G. The radio labeling is a radio -labeling when . When 1, a radio -labeling is called a radio antipodal

labeling. In otherwords, an antipodal labeling for a graph G is a function, : 0,1,2, such that , | | . The radio antipodal number for G, denoted by , is the minimum span of an antipodal labeling admitted by G. A radio labeling is a one-to-one function, while in an antipodal labeling, two vertices of distance apart may receive the same label. The antipodal labeling for graphs was first studied by Chartrand et al.7, in which, among other results, general bounds of were obtained. Khennoufa and Togni9 determined the exact value of for paths . The antipodal labeling for cycles was studied in5, in which lower

Journal of Computer and Mathematical Sciences Vol. 2, Issue 6, 31 December, 2011 Pages (780-898)

869

Albert William, et al., J. Comp. & Math. Sci. Vol.2 (6), 868-872 (2011)

bounds for are obtained. In addition, the bound for the case 2 4 was proved to be the exact value of , and the bound for the case 1 4 was conjectured to be the exact value as well6. Justie Su-tzu Juan and Daphne Der-Fen Liu8 confirmed the conjecture mentioned above. Moreover they determined the value of for the case 3 4 and also for the case 0 4. They improve the known lower bound5 and give an upper bound. They also conjecture that the upper bound is sharp. In this paper we obtain an upper bound for the radio antipodal number of the hexagonal mesh and grid. 2. THE RADIO ANTIPODAL NUMBER OF HEXAGONAL MESH We denote the hexagonal mesh of dimension n by . Let , and be the

three axis inclined mutually at an angle 60 respectively and let , , be the lines (vertical lines) marked from left to right as shown in the figure. We name vertices on , , lines as follows: We name the vertices on from top to bottom as , , , the vertices on from top to bottom , , . Finally we name the vertices on from top to bottom as , , . The diameter of is 2n-2. We first provide an upper bound for the radio antipodal number of the hexagonal mesh of dimension n.

v28 v19 v12 v6 v1 v2 v3 v7 v14 v8 v9 v15 v23 v16 v24 v17 v11 v18 v27 v26 v35 v36 v44 v33 v34 v43 v51 v13 v21 v22 v31 v32 v20 v30 v39 v47 v40 v48 v41 v49 v42 v50 v57 v62 v56 v55 v29 v37 v38 v46 v53 v54 v45 v52 v58 v59 v60 v61

v4 v10 v5

Figure 1(a)

Journal of Computer and Mathematical Sciences Vol. 2, Issue 6, 31 December, 2011 Pages (780-898)

Albert William, et al., J. Comp. & Math. Sci. Vol.2 (6), 868-872 (2011)
183 127 78 36 1 43 8 15 22 29 92 50 99 57 106 64 113 71 120 176 239 169 232 53 162 225 46 102 155 218 39 95 144 179 148 211 32 88 137 172 85 141 204 25 81 130 134 197 18 74 123 158 165 190 11 67 116 4 60 109 151

870

Figure 1(b): Radio antipodal number of with diameter 8

Theorem 1 The radio antipodal number of satisfies Proof. Define a mapping : V 2 3 1 1, 1,2, 3 1 2 3 1 2 3

2 3 3 1 1 1. 2

, 1 , 3 1, .

Then , 1 and

, | | 1 |2 3 1 2 3 1| 2 2.

1 1, 1,2, We claim that , | | 2 2 for all , Case(i):, , 1 .Let and , 1 , 3 1, . Then , 1 and

Case(iii):, , 1 2 1.Let 2 3 1 and

3

2 3 1, 1 ,

5 2, .

Then , 1 and

, | | 1 |2 3 1 2 3 1| 2 2.

, | | 1 |2 3 1 2 3 1| = 1+ 2 3 1 2 3 1 2 2.

Case(ii): , , 1 , , . Let and

Case(iv): , , 1 , 2 1. Let and

Journal of Computer and Mathematical Sciences Vol. 2, Issue 6, 31 December, 2011 Pages (780-898)

871 2, .

Albert William, et al., J. Comp. & Math. Sci. Vol.2 (6), 868-872 (2011)

1 12 23 34 45 56 67 78 89 100 111 122 133 144 155 166 177 188 199 210 221 232 243 254 265 276 287 298 19 30 41 52 63 74 85 96 107 118 129 140 151 162 173 184 195 206 217 228 239

, 1 , 3 5

Then , 1 and

, | | 1 |2 3 1 2 3 1| =1+ 2 3 1 2 3 1 2 2.

3. THE RADIO ANTIPODAL NUMBER OF GRID An n-dimensional mesh , , has , , : 1 , 1 for its vertex set and vertices and , 1 are adjacent in , , . A mesh is a bipartite graph. If at least one side has even length, the mesh has a hamiltonian cycle. A hamiltonian path exists always. Meshes are not regular, but the degree of any vertex is bounded by 2. Of course, the degree of a corner vertex is less than the degree of an internal vertex. See figure 2(a).
v1 v2 v8 v15 v22 v29 v36 v43

Figure 2(b): Radio antipodal number of with diameter 12

Theorem 2: The radio antipodal number of satisfies Proof. Define a mapping : V .

1 1 1 1. 2

1,2, . It is easy to verify that , | | 2 1 for all , . See figure 2(b).

1 1 1 1, 1,2, , 1,2, 2 , 22 3 2 1 1 1, 1,2, ,

v9 v16 v23 v30 v37 v44 v31 v38 v45

v3 v10 v17 v24 v4

4. CONCLUSION The study of radio antipodal number of graphs has gained momentum in recent years. Very few graphs have been proved to have radio antipodal labeling that attains the radio antipodal number. In this paper we have determined the bounds of the radio antipodal number of the hexagonal mesh and grid. Further study is taken up for various other classes of graphs.

v11 v18 v25 v32 v39 v46

v5 v12 v19 v26 v33 v40 v47 v6 v13 v20 v27 v34 v41 v48 v21 v28 v35 v42
Figure 2(a)

v7 v14

v49

Journal of Computer and Mathematical Sciences Vol. 2, Issue 6, 31 December, 2011 Pages (780-898)

Albert William, et al., J. Comp. & Math. Sci. Vol.2 (6), 868-872 (2011)

872

REFERENCES 1. Bharati Rajan, Indra Rajasingh, Kins Yenoke, Paul Manuel, Radio Number of Graphs with Small Diameter, International Journal of Mathematics and Computer Science, Vol 2, 209-220 (2007). Calamoneri T and Petreschi R, L(2,1)Labeling of Planar Graphs, ACM, 2833 (2001). Chang G.J and Lu C, Distance - Two Labeling of Graphs,European Journal of Combinatorics, 24, 53-58 (2003). Chartrand G, Erwin D and Zhang P, Radio k-Colorings of Paths, Disscus Math. Graph Theory, 24, 5-21 (2004). Chartrand G, Erwin D, and Zhang P, Radio Antipodal Colorings of Cycles, Congressus Numerantium, 144 (2000). Chartand G, Erwin D, Zhang P, Kalamazoo Radio Antipodal Coloring

7.

2.

3.

4.

5.

6.

of Graphs, (2000). Chartrand G,Erwin D, and Zhang P, Radio Labeling of Graphs, Bull. Inst. Combin. Appl, 33, 77-85 (2001). 8. Justie Su-tzu Juan and Daphne Der-Fen Liu,, Antipodal Labeling for Cycles, (2006). 9. Khennoufa R and Tongni O, A note on Radio Antipodal Colouring of Paths, Math. Bohem.130 (2005). 10. Mustapha Kchikech, Riadh Khennoufa and Olivier Tongi, Linear and Cyclic Radio k-Labelings of Trees, Discussiones Mathematicae Graph theory, (2007). 11. Ringel G, Theory of Graphs and its Applications, Proceedings of the Symposium Smolenice 1963, Prague Publ.House of Czechoslovak Academy of Science, 162 (1964). 12. Rosa A, Cyclic Steiner Triple Systems and Labeling of Triangular Cacti, Scientia Vol 1, 87-95, (1988).

Journal of Computer and Mathematical Sciences Vol. 2, Issue 6, 31 December, 2011 Pages (780-898)