1) vertex-distinguishing proper edge-coloring
点可区别正常边染色
1.
On the vertex-distinguishing proper edge-coloring of a kind of join graphs;
一类联图的点可区别正常边染色
2.
The vertex-distinguishing proper edge-colorings on K -t n are discussed in this paper.
本文对 K-tn 的点可区别正常边染色进行了讨论 。
2) adjacent vertex distinguishing proper edge coloring
邻点可区别正常边染色
1.
Obviously, a graph G has adjacent vertex distinguishing proper edge coloring if and only if G has no isolated edges.
显然一个图G有邻点可区别正常边染色当且仅当G不含孤立边，对一个无孤立边的图G进行邻点可区别的正常边染色所需要的最少的颜色数称为是G的邻点可区别正常边色数，记为X′_α(G)。
3) D(2)-vertex-distinguishing proper edge-coloring
D(2)-点可区别的正常边染色
4) vertex-distinguishing proper edge chromatic number
点可区别正常边色数
1.
The vertex-distinguishing proper edge chromatic number of P_3∨K_n and P_4∨K_n are obtained in this paper,and the vertex-distinguishing proper edge chromatic number of P_m∨K_n(m≥5) and C_m∨K_n(m≥4) are also discussed.
给出了图P3∨Kn与P4∨Kn的点可区别正常边染色的色数及染色方法,并讨论了图Pm∨Kn(m≥5),Cm∨Kn(m≥4)的点可区别正常边色数,给出了某些情况下它们的确切值。
5) vertex-distinguishing proper edge-colorin
点可区别正常边着色
6) 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)。
补充资料：正常（超导）—超导（正常）转变
正常（超导）—超导（正常）转变
transitionfromnormal(superconducting)statetosuperconducting(normal)state
一般指在常压下改变温度到Tc时，物质的电阻从R＞0（R=0）的正常态（超导态）到R=0（R＞0）的超导态（正常态）的转变。无磁场时这种转变属二级相变。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条