说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 准强边色数
1)  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)。
2)  strong edge-chromatic number
强边色数
3)  quasi-strong edge colourings
准强边着色
1.
If a graph G has a proper edge colourings so that the colouring sets of incident edge at all adjacent vertices in the graph G are different from each other,then such an edge colourings is said to be a quasi-strong edge colourings of graph G.
如果图G已有一个合理边着色,使得图G中所有相邻顶点间的关联边着色集合相互不同,则这种边着色称为图G的准强边着色。
2.
If the graph G had a proper edge colourings and the colouring sets of incident edges at all adjacent vertices of graph G are different from each other,the graph G is said to be a quasi-strong edge colourings.
如果图G有一个合理边上色,使图G的所有相邻顶点的关联边上色集合都互不相同,则称图G为准强边着色。
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)  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-强边色数,并给出了相应的染色方案。
6)  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图的临强边色数。
补充资料:布林克曼准数
分子式:
CAS号:

性质:布林克曼准数式中kf:流体导热系数(J/S·cm·℃);μ:黏度(Pa·s);u:流速(cm/s);TB,Tw分别为流体主体温度和壁温(℃)。Br准数表示由黏滞摩擦产生的热量与由热传导所传递的热量之比,可度量黏滞产热对于导热传热的影响。在大多数流动问题中,黏滞产热并不重要,如在一般的热交换器中,Br准数的影响可予忽略。然而,在一些工程问题中,黏滞产热便变得十分重要,如在搅拌器桨尖附近短距离内存在着巨大速度变化的场合。

说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条