【作者】 张伟；

【导师】 徐常青；

【作者基本信息】 河北工业大学 ， 应用数学， 2011， 硕士

【摘要】 图G的k-(d,1)-全标号是一个映射f:V(G)∪E(G)→{0,1….,k},使得任意2个相邻的点有不同的值,任意2条相邻边有不同值,且任一对相关联的点和边的值差的绝对值至少为d.G的(d,1)-全标号数λdT(G)定义为G有一个k-(d,1)-全标号的最小的k值.对(d,1)-全标号进行了研究,并且完全确定了圈与圈笛卡尔积图和路与圈笛卡尔积图的(d,1)-全标号数(d≥3).更多还原

【Abstract】 The k-(d, 1)-total labelling of a graph G is a mapping f:V(G)∪E(G)→{0,1,...,k}, such that any two adjacent vertices have different labels, any two adjacent edges have different labels, and any incident vertex and edge have the label different at least d. In this paper, we study the (d, 1)-total labelling. For the Cartesian Product of two cycles and the Cartesian Product of path and cycle, we obtain their (d, 1)-total labelling numbers(d≥3).更多还原