L(1, d)-labeling number of direct product of two cycles
*Qiong WuCorresponding authorwuqiong@tute.edu.cnDepartment of Computational ScienceTianjin University of Technology and EducationTianjin, 300222, ChinaView full profile → , Wai Chee Shiuwcshiu@associate.hkbu.edu.hkAffiliation 1Department of MathematicsThe Chinese University of Hong KongShatin, Hong KongAffiliation 2College of Global TalentsBeijing Institute of TechnologyZhuhai, ChinaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Nov 2020
- Accepted:
- 01 Mar 2021
- Published Online:
- 24 May 2022
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-1352
- Pages:
- 2097–2125
Abstract
Keywords
Subject Classifications
References
[1] N. Abrahmson, The ALOHA system-Another alternative for computer communications, Proc. FJCC, (1970), 281-285.
[2] A.A. Bertossi and M.A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Transtractions on Networking, 3(4) (1995), 441–449.
[3] J.A. Bondy, U.S.R. Murty, Graph theory with applications, New York, MacMillan, 1976.
[4] T. Calamoneri, A. Pelc, and R. Petreschi, Labeling trees with a condition at distance two, Discrete Math., 306 (2006), 1534–1539.
[5] X.T. Jin and R.K. Yeh, Graph distance-dependent labeling related to code assignment in computer networks, Naval Research Logistics, 52 (2005) , 159–164.
[6] Q. Niu, (,)Ljk-labeling of graph and edge span, M.Phil. Thesis, Southeast University, 2007.
[7] W.C. Shiu and Q. Wu, (,)Ljk-labeling number of direct product of path and cycle, Acta Math. Sinica, 29 (2013), 1437–1448.
[8] Q. Wu and W. Lin, Circular (,)Ljk-labeling numbers of trees and products of graphs, J. Southeast University, 26(1) (2010),142-145.
[9] Q. Wu and W.C. Shiu, Circular L(j,k)-labeling number of square of paths, J. Combin. Number Theory, 9(1)(2017), 41–46.
[10] Q. Wu and W.C. Shiu, L(j,k)-labeling number of square of paths, AKCE International Journal of Graphs and Combinatorics, 14(3) (2017), 307–316.
[11] Q. Wu, W.C. Shiu and P.K. Sun, L(j,k)-labeling number of Cartesian product of path and cycle, J. Combin. Optimization, 31 (2016), 604–634.
[12] Q. Wu, W.C. Shiu and P.K. Sun, Circular L(j,k)-labeling number of direct product of path and cycle, J. Combin. Optimization, 27(2014), 355–368 .
