说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。
您的位置：首页 -> 词典 -> 点强全着色
1)  vertex strong total coloring
点强全着色
1.
A proper k-total coloring σ of graph G(V,E) is called a k-vertex strong total coloring of G(V,E) if and only if for v∈V(G),the elements in N[v] are colored with different colors,where N[v]={u|vu∈E(G)}∪{v};and χvsT(G)=min{k|there is a k-vertex strong total coloring of G} is called the vertex strong total chromatic number of G.
图G(V,E)的一正常k-全着色σ称为G(V,E)的一个k-点强全着色,当且仅当v∈V(G),N[v]中的元素着不同颜色,其中N[v]={u|vu∈E(G)}∪{v}。
2.
A proper k-total coloring σ of graph G(V,E)is called a k-vertex strong total coloring of G(V,E)if and only if for ν∈V(G),the elements in N[ν]are colored with different colors,where N[ν]={u|νu∈E(G)}∪{ν};and χ~(νs)_(_T)(G)=min{k|there is a k-vertex strong total coloring of G}is called the vertex strong total chromatic number of G.
图G(V,E)的一正常k-全着色σ称为G(V,E)的一个k-点强全着色,当且仅当ν∈V(G),N[ν]中的元素着不同颜色,其中N[ν]={u|νu∈E(G)}∪{ν}。
2)  strong totol coloring
强全着色
3)  verticedge total characterization
点边全着色
4)  vertex strong total coloring
点强全染色
1.
Method on vertex strong total coloring of Halin graphs;
Halin图的一个点强全染色法
2.
A proper k-total coloring σ of graph G(V,E) is called a k-vertex strong total coloring of G(V,E) if and only if for v∈V(G),the elements in N\ are colored with different colors,where N{u|vu∈E(G)}∪{v};and χ~~(vs)__T(G)=min{k| there is a k-vertex strong total coloring of G} is called the vertex strong total chromatic number of G.
图G(V,E)的一个正常k-全染色σ称为G(V,E)的一个k-点强全染色,当且仅当v∈V(G),N[v]中的元素着不同颜色,其中N[v]={u vu∈V(G)}∪{v};并且χvTs(G)=m in{k存在G的一个k-点强全染色}称为G的点强全色数。
3.
A proper k-total coloring / of the graph G(V, E) is said to be a fc-vertex strong total coloring if and only if for every v∈V(G), the elements in N[v] are colored with different colors, where N[v]={u|uv∈V(G)}∪{v}.
图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}。
更多例句>>
5)  vertex strong total chromatic number
点强全色数
1.
The vertex strong total chromatic number of general graphs K(n,m);
广义图K(n,m)的点强全色数
2.
A proper k-total coloring σ of graph G(V,E) is called a k-vertex strong total coloring of G(V,E) if and only if for v∈V(G),the elements in N[v] are colored with different colors,where N[v]={u|vu∈E(G)}∪{v};and χvsT(G)=min{k|there is a k-vertex strong total coloring of G} is called the vertex strong total chromatic number of G.
并且vχsT(G)=min{k|存在G的一个k-点强全着色}称为G(V,E)的点强全色数。
3.
A proper k-total coloring σ of graph G(V,E)is called a k-vertex strong total coloring of G(V,E)if and only if for ν∈V(G),the elements in N[ν]are colored with different colors,where N[ν]={u|νu∈E(G)}∪{ν};and χ~(νs)_(_T)(G)=min{k|there is a k-vertex strong total coloring of G}is called the vertex strong total chromatic number of G.
并且χνsT(G)=min{k|存在G的一个k-点强全着色}称为G(V,E)的点强全色数。
6)  strong edge-coloring
强边着色
1.
In 1985,the famous graph theory expert Erds and Neetil ilconjectured that strong edge-coloring number of a graph is bounded above by 5/4Δ2 when Δ is even and 1/4(5Δ2-2Δ+1) when Δ is odd.
著名图论专家Erds和Neetil对图的强边着色数上界提出了一个猜想:当Δ为偶数时,χ′s(G)≤5/4Δ2;当Δ为奇数时,χ′s(G)≤1/4(5Δ2-2Δ+1),他们给出了当Δ=4的时的最优图。
更多例句>>
补充资料：上海益昌薄板有限公司强对流全氢罩式热处理炉


上海益昌薄板有限公司强对流全氢罩式热处理炉


　　淤“‘负象灵窿曝有限公司‘对‘
　　
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条