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

RADIO LABELING AND RADIO NUMBER FOR GENERALIZED CATERPILLAR GRAPHS  

NAZEER, SAIMA (Lahore College for Women University)
KHAN, M. SAQIB (Department of Mathematics, Lahore Leads University)
KOUSAR, IMRANA (Department of Mathematics, Lahore College for Women University)
NAZEER, WAQAS (Division of Science and Technology, University of Education)
Publication Information
Journal of applied mathematics & informatics / v.34, no.5_6, 2016 , pp. 451-465 More about this Journal
Abstract
A Radio labeling of the graph G is a function g from the vertex set V (G) of G to ℤ+ such that |g(u) - g(v)| ≥ diam(G) + 1 - dG(u, v), where diam(G) and d(u, v) are diameter and distance between u and v in graph G respectively. The radio number rn(G) of G is the smallest number k such that G has radio labeling with max{g(v) : v ∈ V(G)} = k. We investigate radio number for some families of generalized caterpillar graphs.
Keywords
channel assignment; radio labeling; radio umber; generalized caterpillar;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 G. Chartrand, D. Erwin, P. Zhang and F. Harary, Radio labelings of graphs, Bull. Inst. Combin. Appl. 33 (2001), 77-85.
2 G.J. Chang and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996), 309-316.   DOI
3 J.P. Georges and D.W. Mauro, Labeling trees with condition at distance two, Discrete Math. 269 (2003), 127-148.   DOI
4 J.R. Griggs and R.K. Yeh, Labeling graphs with condition at distance 2, SIAM J. Discrete Math. 5 (1992), 586-595.   DOI
5 R.M. Ghemeci, Radio Number for Some Thoren Graphs, Discussiones Mathematicae Graph Theory 30 (2010 ), 201-222.   DOI
6 W.K. Hale, Frequency assignement: theory and application, Proc IEEE, 68 (1980), 1497-1514.   DOI
7 C.Y. Jung, W. Nazeer, S. Nazeer, A. Rafiq and S.M. Kang, Radio Number for Cross Product Pn(P2), International Journal of Pure and Applied Mathematics 97 (2014), 515-525.
8 S.M. Kang, S. Nazeer, W. Nazeer, A. Rauf and Y.C. Kwun, Muliti-level Distence Labeling and Radio Number of Caterpillar Related Graphs, Sylwan 159 (2015), 263-278.
9 M. Kang, S. Nazeer, W. Nazeer and B.Y. Lee, Radio Number of Caterpillar Graphs, Wulfenia 22 (2015), 48-58.
10 S.M. Kang, S. Nazeer, W. Nazeer, I. Kousar and Y.C. Kwun, Radio Labeling and Radio Number of Caterpillar Related Graphs, Mitteilungen Klosterneuburg 65 (2015), 149-159.
11 I. Kousar, S. Nazeer and W. Nazeer, Multi-Level Distance Labellings for Generalized Petersen Graph P(n, 3), Sci. Int. (Lahore) 27 (2015), 1767-1777.
12 D. Liu and M. Xie, Radio number for square cycles, Cong. Numer. 169 (2004), 105-125.
13 D. Liu and M. Xie, Radio number for square paths, Ars Combin. 90 (2009), 307-319.
14 D. Liu and X. Zhu, Multi-level distance labeling for paths and cycles, SIAM Disc. Math. 19 (2005), 610-621.   DOI
15 D. Liu, Radio number for trees, Discrete Mathematics 308 (2008), 1153-1164.   DOI
16 P. Martinez, J. Ortiz, M. Tomova and C. Wyels, Radio numbers for generalized prism graphs, Kodai Math. J. 22 (1999), 131-139.   DOI
17 S. Nazeer, I. Kousar and W. Nazeer, Radio and Radio Antipodal Labellings for Circulant Graphs G(4k + 2; {1, 2}), J. Appl. Math. & informatics 33 (2015), 173-183.   DOI
18 S. Nazeer, I. Kousar and W. Nazeer, Multilevel Distance Labelling for the Graphs Having Diameter Equal to Diameter of Cycle, Sci. Int. (Lahore) 26 (2014), 557-563.
19 S. Nazeer, I. Kousar and W. Nazeer, Radio Number for Prism Related Graphs D*n, Sci. Int. (Lahore) 26 (2014), 551-555.
20 M.T. Rahim, M. Farooq, M. Ali and S. Jan, Multi-level distance labelings for generalized gear graph, International Journal of Mathematics and soft computing 2 (2012), 57-63.   DOI
21 F.S. Roberts, "T-coloring of graphs: recent results and open problems, Discrete Math. 93 (1991), 229-245.   DOI
22 D. Sakai, Labeling Chordal: Distance Two Condition, SIAM J. Discrete Math. 7 (1994), 133-140.   DOI
23 S.K. Vaidya, P.L. Vihol, Radio labeling for some cycle related graphs, International Journal of Mathematics and Soft Computing 2 (2012), 11-24.   DOI
24 S.K. Vaidya and D.D. Bantva, Labeling cacti with a condition at distance two, Le Matematiche 66 (2011), 29-36.
25 S.K. Vaidya, P.L. Vihol, N.A. Dani and D.D. Bantva, L(2,1)-labeling in the context of some graph operations, Journal of Mathematics Research 2 (2010), 109-119.
26 S.K. Vaidya and P.L. Vihol, Radio labeling for some cycle related graphs, International Journal of Mathematics and Soft Computing 2 (2012), 11-24.   DOI
27 S.K. Vaidya, P.L. Vihol, Radio labeling for some cycle related graphs, International Journal of Mathematics and Soft Computing 2 (2012), 11-24.   DOI
28 W. Wang, The L(2,1)-labeling of trees, Discrete Applied Math. 154 (2006), 598-603.   DOI
29 D.B. West, Introduction to Graph Theory, Prentice-Hall of India, 2001.
30 R.K. Yeh, A survey on labeling graphs with condition at distance two, Discrete Math. 306 (2006), 1217-1231.   DOI
31 R.K. Yeh, Labeling Graphs with a Condition at Distance Teo, Ph.D. Thesis, Dept of Math., Universoty of South Carolina, Columbia, SC. 1990.