数学与计算机科学 |
|
|
|
|
Cartesian积的局部边-路替换图的L(2,1)-标号 |
杜娟, 吕大梅, 张科 |
南通大学 理学院, 江苏 南通 226007 |
|
L(2,1)-labelings of the local-edge-path-replacements of Cartesian products |
DU Juan, LYU Damei, ZHANG Ke |
School of Science, Nantong University, Nantong 226007, Jiangsu Province, China |
引用本文:
杜娟, 吕大梅, 张科. Cartesian积的局部边-路替换图的L(2,1)-标号[J]. 浙江大学学报(理学版), 2016, 43(6): 679-681.
DU Juan, LYU Damei, ZHANG Ke. L(2,1)-labelings of the local-edge-path-replacements of Cartesian products. Journal of ZheJIang University(Science Edition), 2016, 43(6): 679-681.
链接本文:
https://www.zjujournals.com/sci/CN/10.3785/j.issn.1008-9497.2016.06.010
或
https://www.zjujournals.com/sci/CN/Y2016/V43/I6/679
|
[1] GRIGGS J R, YEH R K. Labeling graphs with a condition at distance two[J]. Discrete Mathematics,1992(5):586-595. [2] WHITTLESEY M A, GEORGES J P,MAURO D W. On the λ-number of Qn and related graphs[J]. Discrete Mathematics,1995(8):449-506. [3] JHA P K, KLAZAR S, VESEL A. Optimal L(d,1)-labelings of certain directed products of cycles and Cartesian products of cycles[J]. Discrete Applied Mathematics,2005,152:257-265. [4] JHA P K, NARAYANAN A, SOOD P, et al. On L(2,1)-labeling of the Cartesian product of a cycle and a path[J]. Ars Combin,2000,55:81-89. [5] JHA P K. Optimal L(2,1)-labelings of strong Cartesian products of cycles[J].Theory and Appl,2001,48:498-500. [6] JHA P K, KLAZAR S,VESEl A. L(2,1)-labeling of direct products of pathes and cycles[J]. Discrete Applied Mathematics,2005,145:317-325. [7] KUO D, YAN J H. On L(2,1)-labeling of Cartesian products of pathes and cycles[J].Discrete Math,2004,238:137-144. [8] JHA P K. Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination, IEEE Trans Circ Syst-I:Fund[J]. Theory and Appl,2000,147:1531-1534. [9] GEORGES J P, MAURO D W, STEIN M I. Labeling products of complete graphs with a conditionat distance two[J]. SIAM J Discrete Math,2000,14:28-35. [10] ERWIN D J, GEORGES J P, MAURO D W. On labeling the vertices of products of complete graphs with distance constraints[J].Naval Research Logistics,2005,52(2):138-141. [11] GEORGES J P, MAURO D W. Some results on λjk-number of the products of complete graphs[J]. Congr Numer,1995,109:141-159. [12] SCHWARZ C, TROXELL D. L(2,1)-labeling of Cartesian products of two cycles[J].Discrete Appl Math,2006,154:1522-1540. [13] LYU D M. L(2,1)-labelings of the edge-path-replacement of a graph[J]. J Comb Optim,2013,26(4):385-392. [14] LYU D M, LIN N F. L(d,1)-labelings of the edge-path-replacement of a graph[J]. J Comb Optim,2013,26:819-831. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|