Edge Span of L(p,q)-labeling on Graphs

Abstract

图的距离标号问题是经典图着色问题的一个自然推广，源于无线网络频率分配的优化问题. 在该问题的研究中，$L(p,q)\$标号是最早提出的，也是最具代表性的一种距离标号.设\$p,q\$是两个非负整数， 图\$G\$的一个\$L(p,q)\$标号定义为一个非负整数函数 \$c:V(G)\mapsto\{0,1,2,\cdots\}$， 满足：对\$G\$中的任意两个顶点\$u\$和\$v$，若\$d(u,v)=1$则\|c(u)-c(v)|\geqp； 若\$d(u,v)=2$则\$|c(u)-c(v)|\geqq$，其中\$d(u,v)\$表示顶点\$u\$和\$v\$之间的距离....The distance labeling of a graph is a natural extension of the classical graph coloring problem, which arises from a variation of the channel assignment problem in multi-hop radio systems and was firstly formulated as a graph coloring problem by Hale. In the study of distance labeling problem, the$L(p,q)$-labeling receives much attention. Given a graph$G=(V,E)$ and two non-negative integers...学位：理学博士院系专业：数学科学学院_应用数学学号：1902011015400