说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 边材染色
1)  Sapwood dyeing
边材染色
2)  strong edge coloring
强边染色
1.
The list strong edge coloring of graphs with Δ(G)=3;
Δ(G)=3的图的列表强边染色
2.
The strong edge coloring of graphs with Δ(G)=4;
Δ(G)=4的图的强边染色
3)  edge coloring
边染色
1.
On the adjacent strong edge coloring of P_m×P_n and P_m×C_n;
P_m×P_n和P_m×C_n的邻强边染色
2.
On the adjacent strong edge coloring of several class of complete 4-partite graphs;
几类完全4-部图的邻强边染色
3.
Let G be a simple connected graph with order not less than 3,a k-proper edge coloring of G is called adjacent-strong if for arbitrary two adjacent vertices which are incident to different sets of colored edges.
设G是阶数不小于3的简单连通图,G的k-正常边染色称为是邻强的,如果G的任意相邻的两顶点的关联边的颜色构成的集合不同。
4)  edge-coloring
边染色
1.
An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different set of colored edges.
一个图的边染色称为是点可区别的 ,如果任意两个不同的顶点的关联边的颜色的集合不同 。
2.
Among all kinds of branches of graph coloring theory, such as edge-coloring, vertex-coloring, face-coloring, total-coloring and so on, the edge-coloring is given most attention and has many perfect results.
图的染色理论有很多分支,如边染色、点染色、面染色和全染色等。
5)  star-edge coloring
星边染色
1.
This paper defined the star-edge coloring and star chromatic index x′_s(G),and proved that if G is a graph withΔ≥7 then x′_s(G)≤[16(Δ-1)3/2].
定义了星边染色和星边色数x′_s(G),证明了若图G的最大度△≥7,则x′_s(G)≤[16(△-1)3/2]。
2.
Furthermore,a simple and feasible star-edge coloring method is also put forward.
给出了联图Pn∨P2的星边色数和联图Pn∨Pn,Pm∨Pn星边色数的上界,同时也给出了一种简单易行的星边染色方法。
3.
introduced the concept of star-edge coloring of graphs, a star-edge coloring of graph G is a proper edge coloring of G such that any path of length 4 in G is not bicolored.
2006年,刘信生等提出了星边染色的概念,若图G的一个正常边染色满足G中没有长为4的路是2-边染色的,则称此染色是G的一个星边染色,使得G有星边染色的最小颜色数称为星边色数,记作χ _s(G)。
6)  edge colored graph
边染色图
1.
If G is assigned such a coloring,then we say that G is an edge colored graph,or r-edge colored graph.
如果图G有这样的一个染色C,我们就称图G是一个边染色图,或r-边染色图,并用C(e)来表示边e的颜色。
2.
For a given graph C, If each edge of C is assigned a color, then G is an edge colored graph.
对于一个图G,若G的每条边都染上颜色C,则称G为边染色图,记作(G,C)。
补充资料:边材
1.治理边疆的人才。 2.木材外围色泽较淡的部分。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条