说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。
您的位置：首页 -> 词典 -> 邻点可区别均匀全色数
1)  adjacent vertex-distinguishing-equitable total chromatic number
邻点可区别均匀全色数
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)。
2)  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)。
3)  equitable adjacent vertex-distinguish total coloring chromatic number
均匀邻点可区别全染色数
4)  Adjacent vertex distinguishing equitable total chromatic number
邻点可区别的均匀全染色
例句>>
5)  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,则称为点可区别均匀边染色,其所用最少染色数称为点可区别均匀边色数。
6)  vertex-edge adjacent vertex-distinguishing total coloring
点边邻点可区别全色数
1.
f is a mapping from V(G)∪E(G) to {1,2,…,k},then it is called the vertex-edge adjacent vertex-distinguishing total coloring of G if uv∈E(G),f(u)≠f(uv),f(v)≠f(uv),uv∈E(G),C(u)≠C(v),and the minimum number of k is called the vertex-edge adjacent vertex-distinguishing total chromatic number of G,where C(u)={f(u)}∪{f(uv)|uv∈E(G)}.
对简单图G(V,E),存在一个正整数k,使得映射f:V(G)∪E(G)→{1,2,…,k},如果对uv∈E(G),有f(u)≠f(uv),f(v)≠f(uv),且C(u)≠C(v),则称f是图G的点边邻点可区别全染色,且称最小的数k为图G的点边邻点可区别全色数。
补充资料：均匀
分布或分配在各部分的数量相同；时间的间隔相等：今年的雨水很～ㄧ钟摆发出～的声音 ㄧ把马料拌得均均匀匀的。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条