1) equitable adjacent strong edge chromatic number
均匀邻强边色数
1.
χ~(′)_(eas)(G)=min{k|k-EASEC of G} be called the equitable adjacent strong edge chromatic number of G.
并称χe′as(G)=min{k k-EASEC of G}为G的均匀邻强边色数。
2) equitable adjacent strong edge coloring
均匀邻强边染色
1.
In this paper, we study equitable vertex coloring, equitable edge coloring and equitable adjacent strong edge coloring of Pk_n.
本文讨论了路的k方图Pkn的均匀点染色、均匀边染色和均匀邻强边染色,利用图的色数的基本性质和构造染色函数的方法,得到相应的色数χev(Pkn) ,χ′ee(Pkn) ,χ′eas(Pkn) 。
2.
A proper k edge coloring f of G(V,E) be called a k equitable adjacent strong edge coloring, be abbreviatted a k ASEC, of G(V,E) iff every uv∈E(G) have f≠f and ‖E i|-|E j‖≤1, where f={f(wx)|wx∈E(G)}, f(ux) is the color of edge wx∈E(G), and E k={e|e∈E(G) and f(e)=k}; and χ ′ eas (G) =min {k| there is a k EASEC of G} be called the equitable adjacent strong edge chr.
则称 f 为 G(V,E)的一 k-均匀邻强边染色 ,简称 k- EASC,并且称χ′eas(G) =min{ k|存在 G(V,E)的一 k- EASC为 G(V,E)的均匀邻强边色数。
3) 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种情况的染色方法各不相同,并通过对图的着色得到了星和路联图的邻强边色数。
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) adjacent strong edge chromatic number of adjacent vertex-distinguish graph
邻点可区别邻强边色数
6) Equitable chromatic number
均匀色数
1.
In this paper,some conditions for which trees are equitably k-colorable are determined;a sufficient and necessary condition and an explicit formula for the equitable chromatic number of trees with diameter 4 are given.
本文得到树可均匀k-着色的一些条件;直径为4的树可均匀k-着色的一个充分必要条件和均匀色数表达式。
补充资料：思北邻韩二翁西邻因庵主南邻章老秀才
【诗文】：
乡闾耆宿非复前，老章病死今三年。
朝来出门为太息，不见此翁催社钱。
我比翁虽差识字，向来推择尝为吏，事功自计无一毫，尚不如翁终日醉。
【注释】：
【出处】：
乡闾耆宿非复前，老章病死今三年。
朝来出门为太息，不见此翁催社钱。
我比翁虽差识字，向来推择尝为吏，事功自计无一毫，尚不如翁终日醉。
【注释】：
【出处】：
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条