【摘要】 图G的一个(1,1)-全标号就是从点集和边集到非负整数集的一个函数f,且使得:任两个相邻顶点标号不同,任两个相邻边标号不同,以及任两个关联的点和边标号也不同.研究了拟梯子和手镯图的(1,1)-全标号,并完全确定了拟梯子的(1,1)-全标号数.更多还原

【Abstract】 An(1,1)-total-labeling of a graph G 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-labelings of the similarity ladders and bracelet graphs,and completely determine the(1,1)-total-labeings number of the point-join-similarity ladders.更多还原