西北师范大学学报（自然科学版）2017，Vol.53Issue(1)：22-31,10.DOI:10.16783/j.cnki.nwnuz.2017.01.005
均匀完全7-部图的全非正规强度
Total vertex irregularity strength of equitable complete 7-partite graphs
摘要
Abstract
For a simple undirected graph G with vertex set V and edge set E,a total k-labelingλ:V∪E→{1,2,…,k}is called a vertex irregular total k-labeling of G,if for every two distinct vertices x and y of G,their weightsωt(x)andωt(y)are distinct,where the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x.The total vertex irregularity strength of G,denoted by tvs(G),is the minimum k for which the graph G has a vertex irregular total k-labeling. The complete m-partite graph with n vertices in which each part has either nm[ ]∗ or nm[ ]∗ vertices is denoted by Tm,n. In this paper, the total vertex irregularity strength of equitable complete 7-partite graphs T7,n(n≠19)is given.关键词
全非正规k-标号/权/全非正规强度/均匀完全7-部图Key words
vertex irregular total k-labeling/weight/total vertex irregularity strength/equitable complete 7-partite graphs分类
数理科学引用本文复制引用
陈祥恩,魏玉琼,祁丽娟..均匀完全7-部图的全非正规强度[J].西北师范大学学报（自然科学版）,2017,53(1):22-31,10.基金项目
国家自然科学基金资助项目(61163037,61163054,61363060) （61163037,61163054,61363060）
