On L(2,1)-labeling of the Cartesian product of a cycle and a path

Ars Combinatoria

Volumn 55, Issue , 2000, Pages 81-89

  Jha, Pranava K ^a,f   Narayanan, Ashok ^b   Sood, Puneet ^c   Sundaram, Karthik ^d   Sunder, Vivek ^e  

^a MULTIMEDIA UNIVERSITY   (Malaysia)

^b CISCO SYSTEMS   (United States)

^c NORTEL NETWORKS   (United States)

^d NOKIA RESEARCH CENTER   (United States)

^e Proctor/Gamble (I) Ltd: Tiecicon H   (India)

^f NETAJI SUBHAS INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Cartesian product; Cycle; L(2, 1) labeling; Path

Indexed keywords

EID: 0039623182     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. G.J. Chang, W.T. Ke, D. Kuo, D.D.-F. Liu and R.K. Yeh, On L(d,1)-labeling on graphs, Discrete Math. (to appear).
2. G.J. Chang and D. Kuo, The L(2,1)-labeling on graphs, SIAM J. Disc. Math. 9 (1996) 309-316.
3. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., San Francisco, 1979.
4. J. Georges and D.W. Mauro, On the criticality of graphs labelled with a condition at distance two, Congr. Numer. 101 (1994) 33-49.
5. J. Georges and D.W. Mauro, Generalized vertex labelings with a condition at distance two, Congr. Numer. 109 (1995) 141-159.
6. J. Georges and D.W. Mauro, On the size of graphs labeled with a condition at distance two, J. Graph Theory 22 (1996) 47-57.
7. J. Georges, D.W. Mauro and M. Whittlesey, Relating path covering to vertex labellings with a condition at distance two, Discrete Math. 135 (1994) 103-111.
8. J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance two, SIAM J. Disc. Math. 5 (1992) 586-595.
9. P.K. Jha and G. Slutzki, A scheme to construct distance-three codes using latin squares, with applications to the n-cube, Inform. Proc. Lett. 55 (1995) 123-127.
10. K. Jonas, Graph Coloring Analogues With a Condition at Distance Two: L(2,1)-labelings and list λ-labelings, Ph.D. dissertation, Dept. of Math., Univ. South Carolina, Columbia, SC (1993).
11. S. Klavžar and N. Seifter, Dominating Cartesian products of cycles, Discrete Appl. Math. 59 (1995) 129-136.
12. D. Kuo, Graph Labeling Problems, Ph.D. dissertation, Dept. of Applied Math., National Chiao Tung Univ., Hsinchu, Taiwan, 1995.
13. D. D.-F. Liu and R.K. Yeh, On distance-two labellings of graphs, Ars Combin. 47 (1997) 13-22.
14. D. Sakai, Labeling chordal graphs with a condition at distance two, SIAM J. Disc. Math. 7 (1994) 133-140.
15. n and related graphs, SIAM J. Disc. Math. 8 (1995) 499-506.
16. R.K. Yeh, The edge span of distance-two labelings of graphs, Taiwanese J. Math. (to appear).