1) strong chromatic number
强色数
1.
A proper k coloring σ of graph G(V,E) is said to be a k strong coloring of G(V,E ) iff for any two vertices u and v with d(u,v )2 have distinct colors,where d(u,v ) denotes the distance between the vertices u and v ,and x s(G)= min{ k|k -strong coloring of G }is called the strong chromatic number of G .
图 G(V,E)的一正常 k-染色 σ称为 G(V,E)的 - k-强染色当且仅当对任何两个不同顶点 u和 v,只要d(u,v)≤ 2 ,则 u、v染不同颜色 (这里 d(u,v)表示 u,v之间的距离 ) ,并称 xs(G) =min{ k|存在 G的 - k-强染色 }为 G的强色数 ,本文得到 θ-图 ,Cm,n图 ,Halin图的强色数 xs(G
2.
The upper boundary and the extremal graph properties of the strong chromatic number χ s(G) of a simple graph G(V,E)are studied.
研究了简单图G(V ,E)的强色数 χs(G)的上界与极图及 χs(G)与全色数 χT(G)的关系 ;得到了一些特殊图的强色数 χs(G
3) strong chromatic index
强色指数
1.
A new upper bound of the strong chromatic index;
强色指数的一个新的上界
2.
The exact value of the strong chromatic index of the join of two graphs G and H is obtained in terms of the strong chromatic index of G and H.
研究了图G与H的联图强色指数与G、H强色指数之间的关系。
4) strong total chromatic number
强全色数
5) 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种情况的染色方法各不相同,并通过对图的着色得到了星和路联图的邻强边色数。
6) 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-强边色数,并给出了相应的染色方案。
补充资料：色数儿
1.即色子。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条