说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。
您的位置：首页 -> 词典 -> 点强全染色
1)  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}。
更多例句>>
2)  Strong vertex-distinguishing total coloring
点可区别强全染色
例句>>
3)  vertex-face total colouring
点面全染色
4)  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)}∪{ν}。
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)  vertex-distinguishing total coloring
点可区别全染色
1.
In this paper,the vertex-distinguishing and the adjacent vertex-distinguishing total coloring of Kn∨G are studied.
研究了一类联图Kn∨G的点可区别与邻点可区别全染色。
2.
According to the definition and the method of the vertex-distinguishing total coloring,the vertex-distinguishing total coloring of Pm∨Wn is discussed,and the conclusion and proof of the vertex-distinguishing total chromatic number of Pm∨Wn are given.
根据点可区别全染色的概念及其染色方法,讨论了路与轮联图的点可区别全染色,给出了路与轮联图的点可区别全色数的结论及其证明,为进一步探讨其他联图的点可区别全染色提供了理论证据,丰富了图的点可区别全染色的结果。
更多例句>>
补充资料：脆性染色体位点检测法


脆性染色体位点检测法


　　诊法。亦称脆X染色体检测法。系检测某些智力低下及某些肿瘤病人染色体脆位点的细胞遗传学方法。脆X染色体与智力低下有关。外周血培养及染色体制备法同普通培养，但培养基为缺叶酸(MEMFA)或TC199加氨甲蝶啶(MTX)等，小量小牛血清(一般用5%)；pH值为74～75，培 养时间96小时。染色体标本以Giemsa染色后镜检，分析计数。发现标本中有染色体断裂(单体型或染色体型)或脆位点时详细记录。将有脆位点的标本脱油、褪色后，行G及其他有关染色体显带，以确定脆性染色体的区带。
　　
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条