说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。
您的位置：首页 -> 词典 -> 点可区别均匀边色数
1)  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,则称为点可区别均匀边染色,其所用最少染色数称为点可区别均匀边色数。
2)  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)  Distinguishing equitable edge Coloring
点可区别的均匀边染色
例句>>
4)  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)。
5)  vertex-distinguishing edge chromatic number
点可区别边色数
1.
On the vertex-distinguishing edge chromatic number of P_m V W_n;
图P_m V W_n的点可区别边色数
2.
The vertex-distinguishing edge-coloring of F_m∨P_n are studied and vertex-distinguishing edge chromatic number of F_m∨P_n are obtained.
研究了Fm∨Pn的点可区别边染色,给出了Fm∨Pn的点可区别边色数。
3.
In this paper,we have given the vertex-distinguishing edge chromatic number of Cm∨Cn and Cm∨Sn.
对图G的正常边染色,若满足不同点的点所关联边色集合不同,则称此染色法为点可区别的边染色法,其所用最少染色数称为该图的点可区别边色数。
更多例句>>
6)  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)。
补充资料：边色
1.边地的风物景色。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条