说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 4-全色数
1)  4-total chromatic number
4-全色数
1.
This paper has solved the open question proposed by Zhang Zhongfu and others in reference [1],which is to ascertain the attainable lower bound of x4T(G)+x4T(G) ,in which x4T(G) indicates the 4-total chromatic number of a graph G, while G indicates the complement graph of G.
解决了张忠辅等人提出的如下问题:确定x_4~T(G)+x_4~T(G)用的可达下界,其中x_4~T(G)表图G的4-全色数,G表G的补图。
2)  total chromatic number
全色数
1.
The total chromatic number of general graphs K(n,m);
广义图K(n,m)的全色数(英文)
2.
Let G be a simple graph,k is a positive integer and f is a mapping form V(G)∪E(G) to {1,2,…,k},if for any uv∈E(G),there are f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv);for any uv,vw∈E(G),u≠w,there is f(uv)≠f(uw),then f is called a k-proper total coloring of G(k-TC in brief),and the number ΧT(G)=min{k|G存在k-TC} is called the total chromatic number of G.
设G是一个简单图,k为正整数,V(G)∪E(G)到{1,2,…,k}的一个映射f满足:对于任意的uv∈E(G)有f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv);任意的uv,vw∈E(G),u≠w,有f(uv)≠f(uw),则称f为G的k-全染色,简记为k-TC,并称ΧT(G)=min{k|G存在k-TC}为G的全色数。
3)  total chromatic number
全染色数
1.
Then the total chromatic number of G is Δ(G)+1 if(Δ,k)∈{(6,4),(5,5),(4,11)}.
本文对3-圈不重点的,且不含从4到k圈的平面图,得出的结论有:如果(Δ,k)分别是(6,4),(5,5),(4,11),则G的全染色数是Δ(G)+1。
2.
The total chromatic number x1(G) is the smallest interger k such that G has a total k-coloring.
图G的全染色数xT(G)是指使G全k染色的最小整数k。
4)  Renverse principal component analysis
全色数据
5)  star total chromatic number
星全色数
1.
The least number of k spanning over all star total-colorings of G,denoted by χst(G) is called the star total chromatic number of G.
图G的3个顶点的路边和顶点着有5种色,跑遍图G的所有k星全着色所取得的最小数k称为图G的星全色数,简记为sχt(G)。
2.
The least number of k spanning over all star total k-colorings of G,denoted by χst(G),is called the star total chromatic number of G.
图G的全部k-星全着色中最小的k称为图G的星全色数,记为χst(G)。
3.
In this paper,we searched the star total chromatic numbers of Mycielski\'s graphs of complete bipartite graphs,complete graphs and complete multipartite graphs with equipotent parts and obtained the star total chromatic numbers.
讨论了完全二部图、完全图和完全多部图的Mycielski图的星全染色问题,得到了它的星全色数。
6)  weak total chromatic number
弱全色数
补充资料:e(数)


e(数)
(number)

e(数)【e(侧.b叮);e(,,e月。)] 表达式(1十1/n)”当n~的时的极限: 。一,「1十生1”一:.718:81 828。、5…; ”一田Ln」它是自然对数的底.C.Herr面te于1873年最先证明e是一个超越数·有时把‘称为Nap计攀(Napier~-ber),这并没有什么道理.c.A.C代n明。。撰【补注】亦见指数函数(exponent阁丘mction);实指数函数(以因nent认1 ftm Ction,找汾1);数的对数(lo砰山-thmofant助忱r);对数函数(fo李的thln元兔下由n);超越数(加俄。血n司狱叨忱r).张鸿林译
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条