Real number labelings for paths and cycles

Internet Mathematics

Volumn 4, Issue 1, 2007, Pages 65-86

  Griggs, Jerrold R ^a   Jin, Xiaohua Teresa ^b  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

^b University of South Carolina   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 69249247996     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2007.10129140     Document Type: Article

References (16)

1. S. Anand, A. Sridharan, and K. N. Sivarajan. “Performance Analysis of Channelized Cellular Systems with Dynamic Channel Allocation.” IEEE Transactions on Vehicular Technology 52:4 (2003), 847–859.
2. A. A. Bertossi, C. M. Pinotti, and Richard B. Tan. “Channel Assignment with Separation for Inference Avoidance in Wireless Networks.” IEEE Trans. Parallel Distrib. Systems 14:3 (2003), 222–235.
3. T. Calamoneri. “The L(h, k)-Labelling Problem: An Annotated Bibliography.” Online survey updated and posted at http://www.dsi.uniroma1.it/∼calamo/PDF-FILES/survey.pdf, 2006.
4. J. P. Georges and D. W. Mauro. “Generalized Vertex Labelings with a Condition at Distance Two.” Congress. Numer. 109 (1995), 141–159.
5. J. R. Griggs. “Author/Judge’s Commentary: The Outstanding Channel Assignment Papers.” UMAP J. 21 (2000), 379–386.
6. J. R. Griggs and X. T. Jin. “Optimal Channel Assignments for Lattices with Conditions at Distance Two.” In Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, Workshop 12, Volume 13, 8 pp. Los Alamitos, CA: IEEE Computer Society, 2005.
7. J. R. Griggs and X. T. Jin. “Real Number Graph Labellings with Distance Conditions.” SIAM J. Discrete Math. 20 (2006), 302–327.
8. J. R. Griggs and X. T. Jin. “Recent Progress in Mathematics and Engineering on Optimal Graph Labellings with Distance Conditions.” J. Combin. Optimiz. 14 (2007), 249–257.
9. J. R. Griggs and X. T. Jin. “Real Number Channel Assignments for Lattices.” SIAM J. on Discrete Math. 22:3 (2008), 996–1021.
10. J. R. Griggs and D. Král’. “Graph Labellings with Variable Weights, A Survey.” Discrete Appl. Math., to appear.
11. J. R. Griggs and R. K. Yeh. “Labelling Graphs with a Condition at Distance 2.” SIAM J. Disc. Math. 5 (1992), 586–595.
12. W. K. Hale. “Frequency Assignment: Theory and Applications.” Proc. IEEE 68 (1980), 1497–1514.
13. X. T. Jin. “Real Number Graph Labeling with Distance Conditions.’ Ph.D. Dissertation, University of South Carolina, August, 2005.
14. D. Král’. “The Channel Assignment Problem with Variable Weights. SIAM J. Discrete Math. 20 (2006), 690–704.
15. F. S. Roberts. “Working Group Agenda, DIMACS/DIMATIA/Renyi Working Group on Graph Colorings and Their Generalizations.” Available online at http://dimacs.rutgers.edu/Workshops/GraphColor/main.html, 2003.
16. S. Sarkar and K. N. Sivarajan. “Channel Assignment Algorithms Satisfying Cochannel and Adjacent Channel Reuse.” IEEE Transactions on Vehicular Technology 51:5 (2002), 954–967.