设G是阶至少为2的简单图.在点可区别正常全染色的基础上,提出了图G的点可区别一般全染色,即VE-全染色,并且得到了轮、扇和完全二部图K1,n和K2,n的点可区别VE-全色数,据此提出了一个猜想.%Let G be a simple graph of order at least 2.Based on the vertex-distingushing total coloring of graph,the vertex-distingvishing general total coloring(VDVET) of graph G is proposed,then the VDVET chromatic numbers of the wheel,fan,star and complete bipartite graph K2,n are given.Finally,a related conjecture is put forward.
展开▼
