1) Vertex-Distinguishing-Equitable edge coloring
点可区别均匀边染色
1.
A proper edge coloring of graph G is called vertex-distinguishing-equitable edge coloring if colored sets from any two vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required minimum number of colors is called the vertex-distinguishing-equitable edge chromatic number.
如果图G的一个正常边染色满足任意两个不同点的关联边色集不同,且任意两种颜色所染边数目相差不超过1,则称为点可区别均匀边染色,其所用最少染色数称为点可区别均匀边色数。
3) adjacent vertex-distinguishing-equitable total coloring
邻点可区别均匀全染色
1.
We studied adjacent vertex-distinguishing-equitable total coloring(AVDETC) of some double graphs,and developed the adjacent vertex-distinguishing-equitable total chromatic numbers of double graphs of even order complete graph,even order cycle,path,star and wheel using constructive method and matching method,which satisfies the conjecture on AVDETCC.
研究一些倍图的邻点可区别均匀全染色(AVDETC),利用构造法和匹配法给出了偶阶完全图、偶阶圈、路、星和轮的倍图的邻点可区别均匀全色数,并验证了它们满足邻点可区别均匀全染色猜想(AVDETCC)。
4) Vertex-Distinguishing-Equitable edge chromatic number
点可区别均匀边色数
1.
A proper edge coloring of graph G is called vertex-distinguishing-equitable edge coloring if colored sets from any two vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required minimum number of colors is called the vertex-distinguishing-equitable edge chromatic number.
如果图G的一个正常边染色满足任意两个不同点的关联边色集不同,且任意两种颜色所染边数目相差不超过1,则称为点可区别均匀边染色,其所用最少染色数称为点可区别均匀边色数。
5) vertex-distinguishing edge coloring
点可区别边染色
1.
On the vertex-distinguishing edge colorings of some product graphs;
若干积图的点可区别边染色
补充资料：脆性染色体位点检测法
脆性染色体位点检测法
诊法。亦称脆X染色体检测法。系检测某些智力低下及某些肿瘤病人染色体脆位点的细胞遗传学方法。脆X染色体与智力低下有关。外周血培养及染色体制备法同普通培养，但培养基为缺叶酸(MEMFA)或TC199加氨甲蝶啶(MTX)等，小量小牛血清(一般用5%)；pH值为74～75，培 养时间96小时。染色体标本以Giemsa染色后镜检，分析计数。发现标本中有染色体断裂(单体型或染色体型)或脆位点时详细记录。将有脆位点的标本脱油、褪色后，行G及其他有关染色体显带，以确定脆性染色体的区带。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条