期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

L(j,k)-number of Direct Product of Path and Cycle 被引量：6

L(j,k)-number of Direct Product of Path and Cycle
原文传递
导出
摘要 For positive numbers j and k, an L（j,k）-labeling f of G is an assignment of numbers to vertices of G such that ｜f（u）-f（v）｜≥j if uv∈E（G）, and ｜f（u）-f（v）｜≥k if d（u,v）=2. Then the span of f is the difference between the maximum and the minimum numbers assigned by f. The L（j,k）-number of G, denoted by λj,k（G）, is the minimum span over all L（j,k）-labelings of G. In this paper, we give some results about the L（j,k）-number of the direct product of a path and a cycle for j≤k. For positive numbers j and k, an L（j,k）-labeling f of G is an assignment of numbers to vertices of G such that ｜f（u）-f（v）｜≥j if uv∈E（G）, and ｜f（u）-f（v）｜≥k if d（u,v）=2. Then the span of f is the difference between the maximum and the minimum numbers assigned by f. The L（j,k）-number of G, denoted by λj,k（G）, is the minimum span over all L（j,k）-labelings of G. In this paper, we give some results about the L（j,k）-number of the direct product of a path and a cycle for j≤k.
作者 Wai Chee SHIU Qiong WU
机构地区 Department of Mathematics
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2013年第8期1437-1448,共12页 数学学报（英文版）
基金 Supported by Faculty Research Grant, Hong Kong Baptist University
关键词 L（j k）-labeling product of a path and a cycle L（j k）-labeling product of a path and a cycle
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献35

  • 1Battiti, R., Bertossi, A. A., Bonuccelli, M. A.: Assigning codes in wireless networks: Bounds and sealing properties. Wireless Networks, 5, 195 209 (1999).
  • 2Bertossi, A. A., Bonuccelli, M. A.: Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Transtractions on Networking, 3(4), 441 449 (1995).
  • 3Calamoneri, T.: The L(h, k)-labelling problem: An updated survey and annotated bibliography. Comput. g., 54(S), 1344 1371 (2011).
  • 4Calamoneri, T.: Optimal L(h, k)-labeling of regular grids. Discrete Math. and Theoretical Computer Sci- ence, 8, 141 158 (2006).
  • 5Calamoneri, T., Pelc, A., Petreschi, R.: Labeling trees with a condition at distance two. Discrete Math., 306, 1534-1539 (2006).
  • 6Calamoneri, T., Petreschi, R.: L(h, 1)-labeling subclasses of planar graphs. J. Parallel and Distributed Comput., 64(3), 414 426 (2004).
  • 7Chiang, S.-H., Yan, J.-H.: On L(d, 1)-labeling of Cartesian products of a cycle and a path. Discrete Appl. Math., 156, 2867 2881 (2008).
  • 8Erwin, D. J., Georges, J. P., Mauro, D. W.: On labeling the vertices of products of complete graphs with distance constraints. Naval Research Logistics, 52, 138-141 (2003).
  • 9Georges, J. P., Mauro, D. W.: Generalized vertex labeling with a condition at distance two. Congr. Numer., 109, 141-159 (1995).
  • 10Georges, J., Mauro, D. W.: Some results on ,V-numbers of the products of complete graphs. Congr. Numer., 140, 141-160 (1999).

同被引文献2

引证文献6

二级引证文献6

Acta Mathematica Sinica,English Series
2013年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部