高师理科学刊2025，Vol.45Issue(6)：22-26,5.DOI:10.3969/j.issn.1007-9831.2025.06.005
距离图Dn(1,3)的L(j,k)-标号数
The L(j,k)-labeling number of the distance graph Dn(1,3)
何姝萍 1吴琼1
作者信息
- 1. 天津职业技术师范大学 理学院,天津 300222
- 折叠
摘要
Abstract
By abstracting the wireless network as an undirected graph,the site group in the network as a vertex set,the code transmitted to the site as the labeling of the corresponding vertex,and the relationship between the sites as an edge set,the wireless network code assignment problem can be abstracted as the L(j,k)-labeling problem of the graph,where j≤k.Based on the wireless network code assignment problem,the L(j,k)-labeling problem of distance graph is studied,and the L(j,k)-labeling number of distance graph Dn(1,3)has been determined when n>4,where n is the number of vertices.关键词
距离图/标号/标号数/导出子图Key words
distance graph/labeling/labeling number/induced subgraph分类
数理科学引用本文复制引用
何姝萍,吴琼..距离图Dn(1,3)的L(j,k)-标号数[J].高师理科学刊,2025,45(6):22-26,5.
