【摘要】 集合{1,2,…,n}中取4个数字的所有组合经三角排序后任意相邻两个组合都有3个相同数字.利用此结果及组合性质((n+8k 3)-(n 3))≡0(mod4)构造算法,并证明当n≡2(mod8)和(n-1 4)/2+2<m≤(n 4)/2+2时,梯图LmPm×P2的点可区别全色数为n.更多还原

【Abstract】 Let A be a set consisted of all combinations which are made up of four numbers selected from the set {1,2,…,n} discretionarily.By the triangle compositor,It is obtained that for any two adjacent elements C and D in set A,they contain the same three elements.In this paper,by the above idea and((n+8k 3)-(n 3))=0(mod4),It is proved that when n=2(mod8)and (n-1 4)/2+2<m≤(n 4)/2+2,vertex distinguishing total chromatic number of ladder graphs Lm is n.更多还原