1) 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.
根据点可区别全染色的概念及其染色方法,讨论了路与轮联图的点可区别全染色,给出了路与轮联图的点可区别全色数的结论及其证明,为进一步探讨其他联图的点可区别全染色提供了理论证据,丰富了图的点可区别全染色的结果。
2) adjacent Vertex-distinguishing total coloring
邻点可区别全染色
1.
On the adjacent vertex-distinguishing total coloring of K(r,2m);
图K(r,2m)的邻点可区别全染色
2.
The adjacent vertex-distinguishing total coloring of k-multi-Mycielski the graphs;
多重Mycielski图的邻点可区别全染色
3.
On the adjacent vertex-distinguishing total coloring of some generalized Petersen graphs;
若干广义Petersen图的邻点可区别全染色
3) adjacent-vertex-distinguishing total coloring
邻点可区别全染色
1.
For a connected graph G with an order no less than 2,the adjacent-vertex-distinguishing total coloring on it means that the color and color set of arbitrary two adjacent vertices on G is different and,furthermore,the color of arbitrary two adjacent sides with a vertex is different from that of their correlative sides as well.
设G是阶数不小于2的连通图,则其邻点可区别全染色是指G中任意两个相邻的顶点有不同的颜色和色集合,且任意相邻的两条边及一个顶点与其关联边的颜色也不相同。
2.
For f, if any pair adjacent vertices have different color sets, then f is called an adjacent-vertex-distinguishing total coloring.
对此f,如果G的任意两个相邻顶点的色集合不同,则称f为G的邻点可区别全染色。
3.
Let x_(at)(G)=min{k|G has a k-adjacent-vertex-distinguishing total coloring}.
如果f是k-正常全染色,且对任意u,v∈V(G),uv∈E(G),有C_f(u)≠C_f(v),那么称f为图G的邻点可区别全染色(简称为k-AVDTC)。
4) adjacent strong total chromatic number of graphs
邻点可区别的全染色数
5) adjacent vertex distinguishing total coloring
邻点可区别全染色
1.
On the adjacent vertex distinguishing total coloring of p_m×K_(n,n)
p_m×K_(n,n)的邻点可区别全染色
2.
On the adjacent vertex distinguishing total coloring of a class of join-graph
一类沿联图的邻点可区别全染色
3.
The adjacent strong edge colorings of generalized Mycielski′s graph M_n(C_p) of cycle C_p and the adjacent vertex distinguishing total coloring of the generalized Mycielski′s graph M_n(K_p) of complete graph K_p was studied.
研究了圈Cp和完全图Kp的Mycielski′s图的邻强边染色和邻点可区别全染色的问题,得到了如下结果:如果连通图G(V,E)满足a′χs(G)=Δ(G),则χas(Mn(G))=Δ(Mn(G));圈的Mycielski′s图的邻强边色数为5;p阶完全图的Mycielski′s图的邻点可区别全染色为2p。
6) D(β)-vertex-distinguishing total coloring
D(β)-点可区别全染色
补充资料：脆性染色体位点检测法
脆性染色体位点检测法
诊法。亦称脆X染色体检测法。系检测某些智力低下及某些肿瘤病人染色体脆位点的细胞遗传学方法。脆X染色体与智力低下有关。外周血培养及染色体制备法同普通培养，但培养基为缺叶酸(MEMFA)或TC199加氨甲蝶啶(MTX)等，小量小牛血清(一般用5%)；pH值为74～75，培 养时间96小时。染色体标本以Giemsa染色后镜检，分析计数。发现标本中有染色体断裂(单体型或染色体型)或脆位点时详细记录。将有脆位点的标本脱油、褪色后，行G及其他有关染色体显带，以确定脆性染色体的区带。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条