针对图的邻点可区别均匀E-全染色问题,用结构分析的方法和穷举法研究图Cn,m(n≥3,m≥1)的邻点可区别均匀E-全染色问题,得到它们的邻点可区别均匀E-全色数,并验证结果的有效性.
Aimed at the problem of adjacent-vertex-distinguishable equitable E-total coloring of graphs,the adjacent-vertex-distinguishable equitable E-total coloring of the graphs Cn,m(n≥3,m≥1)was studied by using method of structural analysis combined with exhaustion method and their adjacent-vertex-distinguishable equitable E-total chromatic numbers were obtained.The effectiveness of the result was also tested and verified.