期刊文献+

一个圈与一个完全二部图的直积的L(2,1)-标号

L(2,1)-Labeling of the direct product of a cycle and a complete bipartite graph
下载PDF
导出
摘要 通过分类讨论、归纳综合的方法,研究了一个圈与一个完全二部图的直积的L(2,1)-标号问题,得到了以下的结果:(1)当n≥3时,C3×Kn,n的L(2,1)-标号数为3n+1;当n≥3时,C4×Kn,n的L(2,1)-标号数的上界是4n;当n≥3时,C5×Kn,n的L(2,1)-标号数为5n-1;(2)当n≥3,m≥6,m≡0(mod3)时,Cm×Kn,n的L(2,1)-标号数为3n+1;当n≥3,m≥6,m≡1(mod3)或m≡2(mod3)时,Cm×Kn,n的L(2,1)-标号数的上界是4n. Through the classification discussion, induction method, a cycle and a complete bipartitegraph of di- rect product of L(2,1 )-labeling problem is studied and the following results are obtained: (1)if n ≥3 the L(2,1 )- labeling number of C3 x Kn,n is determined as 3n + 1 ;if n ≥3 the upper bound of the L(2,1 ) -labeling number is 4n; if n ≥3 the L(2,1)-labeling number of C5 ×Kn,n is determined as 5n - 1 ; (2)if n ≥3,m ≥6,m≡0.(mod3) the L ( 2,1 ) -labeling number of Ca × Kn,n is determined as 3 n + 1 ; if n ≥ 3, m ≥ 6, m ≡ 1 ( mod3 ) or m ≡ 2 ( mod3 ) the upper bound of the L(2,1 )-labeling number is 4n.
出处 《南阳师范学院学报》 CAS 2016年第9期7-10,共4页 Journal of Nanyang Normal University
基金 国家自然科学基金资助项目(11171114)
关键词 L(2 1)-标号 L(2 1)-标号数 两个图的直积 L ( 2,1 ) -labeling L ( 2,1 ) -labeling number direct product of two graphs
  • 相关文献

参考文献1

二级参考文献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).

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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