拟梯子的(2,1)-全标号

The(2,1)-total-labelings of the similarity ladders

图的一个(2,1)-全标号指的是从点集和边集到非负整数集的一个函数f,且使得:任两个相邻顶点标号相异;任两个相邻边标号相异;以及任两个关联的点和边标号差至少为2.本文研究了拟梯子的(2,1)-全标号,并完全确定了拟梯子的(2,1)-全标号数.

An（2,1）-total-labeling of a graph is a function f from the vertex set and edge set to the set of all nonnegative integers such that the labels are different for two adjacent vertices,and for two adjacent edges,and the difference of the labels between a vertex and an edge which are incident is at least 2.In this paper,we study the（2,1）-total-labeling of the similarity ladders,and completely determine the（2,1）-total-labeling number of the similarity ladders.