1) adjacent strong edge chromatic number of adjacent vertex-distinguish graph
邻点可区别邻强边色数
2) vertex-edge adjacent vertex-distinguishing total coloring
点边邻点可区别全色数
1.
f is a mapping from V(G)∪E(G) to {1,2,…,k},then it is called the vertex-edge adjacent vertex-distinguishing total coloring of G if uv∈E(G),f(u)≠f(uv),f(v)≠f(uv),uv∈E(G),C(u)≠C(v),and the minimum number of k is called the vertex-edge adjacent vertex-distinguishing total chromatic number of G,where C(u)={f(u)}∪{f(uv)|uv∈E(G)}.
对简单图G(V,E),存在一个正整数k,使得映射f:V(G)∪E(G)→{1,2,…,k},如果对uv∈E(G),有f(u)≠f(uv),f(v)≠f(uv),且C(u)≠C(v),则称f是图G的点边邻点可区别全染色,且称最小的数k为图G的点边邻点可区别全色数。
3) chromatic number of adjacent-position distinguishable edge coloring
邻点可区别边色数
1.
The chromatic number of adjacent-position distinguishable edge coloring of multi-joined graph S_m∨P_n∨P_n;
多重联图S_m∨P_n∨P_n的邻点可区别边色数
4) vertex-distinguishing edge chromatic number
邻点可区别的边色数
1.
Adjacent vertex-distinguishing edge chromatic number of Cm V Kn;
C_m∨K_n的邻点可区别的边色数(英文)
5) adjacent vertex distinguishing proper edge chromatic number
邻点可区别正常边色数
1.
The minimum number required for an adjacent vertex distinguishing proper edge coloring of G is called the adjacent vertex distinguishing proper edge chromatic number, denoted by x _a(G)- The adjacent vertex distinguishing proper edge chroma.
显然一个图G有邻点可区别正常边染色当且仅当G不含孤立边，对一个无孤立边的图G进行邻点可区别的正常边染色所需要的最少的颜色数称为是G的邻点可区别正常边色数，记为X′_α(G)。
6) adjacent-vertex-distinguishing-edge total chromatic number
邻点可区别-边全色数
补充资料：卢照邻
| 卢照邻(约636～695后) 中国唐代诗人。字升之，自号幽忧子。生卒年史无明载。幽州范阳（今河北涿州）人。与王勃、杨炯、骆宾王并称初唐四杰。博学能文。由于政治上坎坷失意和长期病痛折磨，自投颍水而死。他擅长诗歌、骈文。诗以歌行体为最佳。意境清迥，以韵致取胜。代表作如《长安古意》，借古讽今，寄慨深微，耐人寻味，词句清丽，委婉顿挫。是初唐长篇歌行的佳作。其集今存《卢升之集》、《幽忧子集》均7卷。徐明霞点校《卢照邻集》即据后者，并作《补遗》。《全唐诗》存其诗2卷。傅璇琮著有《卢照邻杨炯简谱》。 |
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条