苏州科技学院学报（自然科学版）2016，Vol.33Issue(3)：18-21,4.
两类特殊图的邻点强可区别E－全染色
On the adaject vertex strongly distinguishing E-total coloring of two special graphs
摘要
Abstract
Let G (V,E) be a simple graph,k be a positive integer,f is a mapping from V (G)∪E (G) to {1, 2,…,k},then f is called the adgacent vertex strongly distinguishing E-total coloring of G and the minimum num-ber of k is called the adjacent vertex strongly distinguishing E-total chromatic of G, ifuv∈E(G) f(u)≠f(v), f (u)≠f (uv),uv∈E (G),C (u)≠C (v). Based on this, this paper studied the adjacent vertex strongly distin-guishing E-total coloring of graph of Fm×Fn and M(pn2) with the structure staining method. And the adjacent ver-tex strongly distinguishing E-total chromatic numbers of both graphs were obtained thereby.关键词
笛卡尔积图/k方图/邻点强可区别E-全染色/邻点强可区别E-全色数Key words
Cartesian graph/k-square graph/adjacent vertex strongly distinguishing E-total coloring/adjacent vertex strongly distinguishing E-total chromatic number分类
数理科学引用本文复制引用
顾忠栋,强会英,魏邦魁..两类特殊图的邻点强可区别E－全染色[J].苏州科技学院学报（自然科学版）,2016,33(3):18-21,4.基金项目
国家自然科学基金资助项目 （）
