1) 2-distance Coloring of Graphs
图的2-距离着色
2) double distanced k-coloring
图的连2距k着色
3) graph coloring
图的着色
1.
The k-Graph Coloring procedure was introduced.
图的着色问题是一典型的优化的问题,用蚂蚁算法求解图着色问题,可保证程序运行的高效率及高收敛性,有效避免了解此问题时极易陷入局部极小的缺陷,并且能较快的收敛。
4) 2-distance coloring
2-距离染色
1.
The 2-distance coloring of graph G is a proper vertex coloring such that no two vertices at distance less than or equal to 2 in G are assigned the same color.
简单图G(V,E)的k-正常染色f称作G的k-2-距离染色,当且仅当w∈V(G),v,u∈N[w],满足f(u)≠f(v)。
2.
The 2-distance coloring of a graph G is a proper vertex coloring such that no two vertices at distance less than or equal to 2 in G are assigned the same color.
图G(V,E)的2-距离染色是指正常的顶点染色,且距离不大于2的任意两个顶点着不同的颜色。
3.
The 2-distance coloring of graph G(V,E) means a proper vertex coloring such that no two vertices at distance less than or equal to 2 in G were assigned the same color.
图G(V,E)的2-距离染色是指正常的顶点染色,且任意距离不大于2的两个顶点着不同的颜色。
5) 2-distance chromatic number
2-距离色数
1.
The 2-distance chromatic number of Cartesian product of graphs;
笛卡尔积图的2-距离色数
2.
2-distance chromatic number of weak direct product graphs
弱直积图的2-距离色数
3.
We obtained a lower bound of 2-distance chromatic number of family of graphs with maximum degree Δ,χ2(Δ=d)≥(d2+1)2,d≡0(mod 2)(d+1)(d+3)4,d≡1(mod 2)We have also answered a question which was stated in [1]: for any graph G, does there exist a constant C such that χ2(G)≤CΔ(G)? We have proved the constant C is not existent.
得到了最大度为Δ的图类的2-距离色数的一个下界,χ2(Δ=d)≥(d2+1)2,d≡0(mod 2)(d+1)(d+3)4,d≡1(mod 2)并回答了文献[1]提出的问题:能否找到一常数C,使得χ2(G)≤CΔ(G)对所有图G都成立。
6) Real Number Graph Labeling with a Condition at Distance Two
依距离2的图标号
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条