拟mbius梯子的(1,1)-全标号

The(1,1)-total-labelings of the Similarity Mbius Ladders

图的(1,1)-全标号是从点集及边集到非负整数集的一个函数f,且满足:任两相邻顶点标号相异;任两相邻边标号相异;及任关联的点和边标号也相异.本文对拟mbius梯子的(1,1)-全标号进行研究,确定了拟mbius梯子的(1,1)-全标号数.

An（ 1,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,two adjacent edges,and for a vertex and an edge which are incident.In this paper,we study the（ 1,1）-total-labeling of the similarity mbius ladders,and determine the（ 1,1）-total-labeling number of the similarity mbius ladders.