说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。
您的位置：首页 -> 词典 -> 2-强边色数
1)  2-strong edge coloring number
2-强边色数
1.
For any tree,the paper proposed a sufficient condi- tion of 2-strong edge coloring number equals to the maximum degree plus one,and obtained the 2-strong edge coloring number of cycles,complete bipartite graphs and wheels,and the color- ing schemes of these graphs are given.
对于树,给出了2-强边色数等于最大顶点度加1的充分条件;对于圈、完全二部图及轮图,求出了2-强边色数,并给出了相应的染色方案。
2)  strong edge-chromatic number
强边色数
例句>>
3)  2-strong edge coloring
2-强边染色
例句>>
4)  adjacent strong edge chromatic number
邻强边色数
1.
The edge chromatic number and adjacent strong edge chromatic number of graph F_m W_n;
图F_m W_n的边色数和邻强边色数
2.
In this paper,we proved that the total chromatic number and adjacent strong edge chromatic number of Cartesian product graph of cycle Cm and cycle C5n.
证明了圈Cm与圈C5n的笛卡尔积图的全色数和邻强边色数都为5。
3.
The adjacent strong edge chromatic number of join graph of star and path is obtained.
为了解决图的邻强边染色问题中一个图的色数算法问题,通过特别的方法来记图的染色过程,同时分4种情况讨论了星和路联图的邻强边染色问题,指出在染色过程中给定的4种情况的染色方法各不相同,并通过对图的着色得到了星和路联图的邻强边色数。
更多例句>>
5)  adjacent strong edge chromatic number
临强边色数
1.
In this paper, we have proved the adjacent strong edge chromatic number of Mycielski graph of some graphs such as path, cycle, fan, wheel, star and complete graph.
本文得到了路、圈、扇、轮、星、完全图的Mycielski图的临强边色数。
6)  quasi-strong edge chromatic number
准强边色数
1.
The minimum chromatic number,which makes the graph G have a quasi-strong edge coloring,is said to be the quasi-strong edge chromatic number of graphs,denoted by χ′qs(G).
使图G有一个准强边着色的最小色数称为网络图(或准强边着色图)的准强边色数,它被记为χ′qs(G)。
补充资料：边色
1.边地的风物景色。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条