 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   coloring of graph 的翻译结果: 查询用时：0.17秒 在分类学科中查询 所有学科 数学 更多类别查询 历史查询  coloring of graph 图的染色(2)  图的染色
 On Some Coloring of Graph 图的染色 短句来源 In the paper, we use special method to remember the process of the coloring of graph. We define: χ′as(G)=min{k|k is the kadjacent strong edge coloring of G}. 记χ′as(G)=min{k｜k为G的k-邻强边着色法}. 本文将通过特别的方法来记图的染色过程. 短句来源 “coloring of graph”译为未确定词的双语例句
 A proper k-total coloringf of G(V,E) is said to be a k-equitable total coloring of graph G(V,E),if the number of vertices and edges in any two color classes differ at most one. χet(G)=min{k| G has a k-equitable total coloring} is called the equitable total chromatic number of G. 对于图G(V,E)的正常k-全染色f称为G(V,E)的k-均匀全染色,当且仅当任意2个色类中的元素总数至多相差1.eχt(G)=min{k|G有k-均匀全染色}称为G的均匀全色数. 短句来源 If(1) for every uv, vw G E(G), u ≠ w, we have f(uv) ≠ f(vw); (2) for every uv ∈ E(G), we have f(u) ≠ f(v), f(u) ≠ f(uv), f(v) ≠ f(uv), then f is called a k-proper total coloring of graph G. (2)对任意uv∈E(G),有f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),则称f为G的k-正常全染色. 短句来源 The L(1,1)-labeling of L(G) is analogous to the strong edge coloring of graph G. 线图L(G)的L(1，1)-标号是类似于图G的强边-染色，记S_(X′)(G)(S_(X′_l)(G))为G的强边-色数(列表-强边-色数)，那么S_(X′)(G)=λ′_(1，1)(G)+1。 短句来源 And through the coloring of graph, we get the following results: the adjacent strong coloring of K(5,2),K(6,2) and K(7,2) are their own 4,7,11. 并通过对图的着色得到以下结果:K(5,2),K(6,2),K(7,2)邻强边色数分别为4,7,11.其中K(m,n)表n个元素中,m元素的Kesern图. 短句来源 A proper k-total coloring φ of G(V,E) is said to be a k-equitable total coloring of graph G(V,E),iff the number of vertices and edges in any two color classes differ by at most one and let x~(ve)_e(G)=min｛k|G has a k-equitable total coloring｝ is called the equitable total chromatic number of G. 对于图G(V,E)的正常k-全染色φ称为G(V,E)的k-均匀全染色,当且仅当任意两个色类中的元素总数至多相差1.xvee(G)=m in{k存在图G的一个k-均匀全染色}称为G的均匀全色数. 短句来源 更多 相似匹配句对
 Graph Coloring Algorithm 关于图染色的算法 短句来源 On Some Coloring of Graph 图的染色 短句来源 On the Coloring of Pseudo-Halin Graph 关于伪-Halin图的几种着色研究 短句来源 The k-Graph Coloring procedure was introduced. 本文着重介绍了用蚂蚁算法解k色图的着色问题的详细步骤。 短句来源 List-coloring of Wheel Graph 轮图的列表染色 短句来源 查询“coloring of graph”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  coloring of graph
 A vertex distinguishing equitable total coloring of graph G is a proper total coloring of graph G such that any two distinct vertices' coloring sets are not identical and the difference of the elements colored by any two colors is not more than 1. A coloring of graph vertices is called acyclic if the ends of each edge are colored in distinct colors and there are no two-colored cycles. In this paper,a model-interval colouring of graphs was introduced,a polynomial algorithm for interval colouring of comparability graphs was presented and the algorithm for coloring of graphs was improved. 本文提出了图的区间着色模型,并对相容性图给出了区间着色的多项式算法,同时改进了求图的着色问题的算法。 Let: i, j, k and α are real, and α, k are constant, i+j=α, if | i_1-j_1 |≤ | i_8-j_8 |, then |. k-i_1 | + | k-j_1 |≤| k-i_2 | + | k-j_2 |. This inequality is used to prove an inequality in generalized edge coloring of graph. 本文先证明下述不等式:设i,j,k,a皆为实数,其中a,k为常数,i+j=a,当|i_1—j_1|≤|i_2—j_2|时,有|k—i_1|+|k—j_1|≤|k—i_2|+|k—j_2|,再利用此不等式来证明图的广义边着色中的一个不等式。 This survey describes some results in connection wlth edge-coloring of graphs These results include the classification theorems,the construction of critical graphs the number of edgec of critlcal graphs,uniquely colorable graphs,the chromatic index of regular graphs and Snark graphs,etc. 本文概述了图边着色的分类定理、临界图的构造、临界图的边数、唯一着色、正则图的色数、Snafks 等问题。 << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关coloring of graph的内容 在知识搜索中查有关coloring of graph的内容 在数字搜索中查有关coloring of graph的内容 在概念知识元中查有关coloring of graph的内容 在学术趋势中查有关coloring of graph的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社