Optimal L (3) Jha, Pranava K a Klavžar, Sandi b Vesel, Aleksander b a ST CLOUD STATE UNIVERSITY (United States) b UNIVERSITY OF MARIBOR (Slovenia)

Discrete Applied Mathematics

Volumn 152, Issue 1-3, 2005, Pages 257-265

Author keywords

Cartesian product of graphs; Channel assignment; Direct product of graphs; L

Indexed keywords

DATA REDUCTION; GRAPH THEORY; LEAST SQUARES APPROXIMATIONS; PRODUCT DEVELOPMENT; THEOREM PROVING;

ADJACENT VERTICES; CARTESIAN PRODUCTS OF GRAPHS; CHANNEL ASSIGNMENT; DIRECT PRODUCTS OF GRAPHS; L

OPTIMAL CONTROL SYSTEMS;

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

References (15)

1. J.P. Georges, and D.W. Mauro Generalized vertex labelings with a condition at distance two Congr. Numer. 109 1995 141 159
2. J.P. Georges, D.W. Mauro, and M.I. Stein Labeling products of complete graphs with a condition at distance two SIAM J. Discrete Math. 14 2001 28 35
3. J.P. Georges, D.W. Mauro, and M.A. Whittlesey Relating path coverings to vertex labellings with a condition at distance two Discrete Math. 135 1994 103 111
4. J.R. Griggs, and R.K. Yeh Labelling graphs with a condition at distance two SIAM J. Discrete Math. 5 1992 586 595
5. W.K. Hale Frequency assignment: theory and application Proc. IEEE 68 1980 1497 1514
6. W. Imrich, and S. Klavžar Product Graphs: Structure and Recognition 2000 Wiley New York
7. P.K. Jha, 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.
8. P.K. Jha, Optimal L (2, 1 ) -labeling of strong products of cycles, IEEE Trans. Circuits and Systems - I: Fund. Theory and Appl. 48 (2001) 498-500.
9. P.K. Jha Smallest independent dominating sets in Kronecker products of cycles Discrete Appl. Math. 113 2001 303 306
10. S. Klavžar, and A. Vesel 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
11. D. Kuo, and J. Yan Discrete Math. 283 2004 137 144
12. D.D.-F. Liu, and R.K. Yeh On distance-two labelings of graphs Ars Combin. 47 1997 13 22
13. F.S. Roberts T-colorings of graphs: recent results and open problems Discrete Math. 93 1991 229 245
14. C. Schwarz, D.S. Troxell, L (2, 1 ) -labeling of Cartesian products of paths and cycles, DIMACS Technical Report 33 (2003), Rutgers University, New Brunswick, NJ.
15. M.A. Whittlesey, J.P. Georges, and D.W. Mauro On the λ -number of Q n and related graphs SIAM J. Discrete Math. 8 1995 499 506