The minimum span of L(2,1)-labelings of certain generalized Petersen graphs

Discrete Applied Mathematics

Volumn 155, Issue 10, 2007, Pages 1314-1325

  Adams, Sarah Spence ^a   Cass, Jonathan ^a   Tesch, Matthew ^a   Troxell, Denise Sakai ^b   Wheeland, Cody ^a  

^a FRANKLIN W OLIN COLLEGE OF ENGINEERING   (United States)

^b BABSON COLLEGE   (United States)

Author keywords

Channel assignment; Distance two labeling; Generalized Petersen graph; Graph labeling; L(2,1) coloring; L(2,1) labeling

Indexed keywords

COMPUTATIONAL GEOMETRY; NUMBER THEORY; OPTIMIZATION; PROBLEM SOLVING; STATISTICAL METHODS;

CHANNEL ASSIGNMENT PROBLEMS; GENERALIZED PETERSEN GRAPHS (GPG); GRAPH LABELING; INTEGERS; ISOMORPHISM;

GRAPH THEORY;

EID: 34247127775     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.12.001     Document Type: Article

References (20)

1. Adams S.S., Cass J., and Troxell D.S. An extension of the channel-assignment problem: L(2,1)-labelings of generalized Petersen graphs. IEEE Trans. Circuits and Systems I 53 (2006) 1101-1107
2. T. Calamoneri, The L(h,k)-labelling problem: a survey and annotated bibliography, Comput. J. 49 (2006) 585-608.
3. Georges J.P., and Mauro D.W. On generalized Petersen graphs labeled with a condition at distance two. Discrete Math. 259 (2002) 311-318
4. Georges J.P., and Mauro D.W. On regular graphs optimally labeled with a condition at distance two. SIAM J. Discrete Math. 17 (2003) 320-331
5. Georges J.P., Mauro D.W., and Whittlesey M.A. Relating path coverings to vertex labelings with a condition at distance two. Discrete Math. 135 (1994) 103-111
6. Golomb S.W., and Welch L.R. On the enumeration of Polygons. Amer. Math. Monthly 67 (1960) 349-353
7. D. Gonçalves, On the L(p,1)-labelling of graphs, in: EuroComb 2005, Discrete Mathemathics and Theoretical Computer Science Proceedings, vol. AE, 2005, pp. 81-86.
8. Griggs J.R., and Jin X.T. Real number graph labellings with distance two conditions. SIAM J. Discrete Math. 20 (2006) 302-327
9. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 585-595
10. Hale W.K. Frequency assignment: theory and applications. Proc. IEEE 68 (1980) 1497-1514
11. Jha P.K. Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination. IEEE Trans. Circuits and Systems I: Fund. Theory Appl. 47 (2000) 1531-1534
12. Jha P.K. Optimal L(2,1)-labeling of strong products of cycles. IEEE Trans. Circuits and Systems I: Fund. Theory Appl. 48 (2001) 498-500
13. Jha P.K., Klavžar S., and Vesel A. Optimal L(2,1)-labelings of certain direct products of cycles and Cartesian products of cycles. Discrete Appl. Math. 152 (2005) 257-265
14. Jha P.K., Klavžar S., and Vesel A. L(2,1)-labelings of direct product of paths and cycles. Discrete Appl. Math. 145 (2005) 317-325
15. Jha P.K., Narayanan A., Sood P., Sundaram K., and Sunder V. On L(2,1)-labeling of the Cartesian product of a cycle and a path. ARS Combin. 55 (2000) 81-89
16. Klavžar S., and Vesel A. Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers. Discrete Appl. Math. 129 (2003) 449-460
17. Kuo D., and Yan J. On L(2,1)-labelings of the Cartesian products of paths and cycles. Discrete Math. 283 (2004) 137-144
18. Schwarz C., and Troxell D.S. L(2,1)-labelings of Cartesian products of two cycles. Discrete Appl. Math. 154 (2006) 1522-1540
19. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
20. Yeh R.K. A survey on labeling graphs with a condition at distance two. Discrete Math. 306 (2006) 1217-1231