 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   边临界图 的翻译结果: 查询用时：0.008秒 在分类学科中查询 所有学科 更多类别查询 历史查询  边临界图  edge critical graph
 In this paper, we have defin d total-colourable critical graph andhave proved X_T(G) = Δ(G) + 2 (for |{υ|d(υ) = Δ(G), υ∈V(G)}|≥3), where,G is a total-colourable edge critical graph, Δ(G) is maximum degree of GX_T(C) is total-colourable number of G. 本文定义了全着色临界图,并证明了对于 |{v|d(v)=△(G),v∈6V(G)}|≥3的全着色边临界图G(V.E),有 xт(G)=△(G)+2.其中△(G)表示G的最大度,xт(G)表示G的全色数. 短句来源 “边临界图”译为未确定词的双语例句
 P_∞-k-Edge critical graph P_∞-k-边临界图 短句来源 This paper gives some simple properties of P_∞-k-Edge critical graph, the foUowing results are proved: (1) If X' (G; P_∞)=k, then G contains a P_∞-L-Edge critical subgraph, where L≤k. 本文证明了P_∞—K—边临界图的一些简单性质。 主要结果:(1)若X~-1(G;P_∞)=K,则对所有L≤K,G包含一个P_∞—L—边临界子图; 短句来源 (2) If G is a P_∞-k-Edge critical graph, H is path and HG, |H|≥1, H∈P_∞, then X' (G-H; P_∞)=k-1. (2)设G是P_∞—K—边临界图,H是G中长至少为1的路,且H∈P_∞,则x~1(G—H;P_∞)—K—1。 短句来源 And we consider the special case of b′\-w(G), that b′\-w(G) is equal to 1, we call G is edge-removal-critical(ER-critical). Then give necessary and sufficient condition for regular graphs to be γ\-w-ER-critical and necessary condition for general graph to be γ\-w-ER-critical. 称b′w(G)=1图为弱控制去边临界图,简记为γw-ER-critical,本文研究了正则图是弱控制去边临界图的充要条件,以及一般图的必要条件. 短句来源 This paper mainly uses the combine of computer's computation and mathematic ratiocination, aims at Hamilton and minimum edges properties on domination edge-critical graph. 本文主要运用计算机计算与数学推理证明相结合的方法，针对支配边临界图，研究其哈密顿性质和最小边数性质。 短句来源 更多 相似匹配句对
 THE EDGE SIZE OF CRITICAL-GRAPH 临界图的边数 短句来源 BOUNDS ON THE LOWER SIZE OF △- CRITICAL GRAPHS 临界图的边数 短句来源 P_∞-k-Edge critical graph P_∞-k-边临界图 短句来源 On X'-critical Graph 边色数临界图 短句来源 Some Properties of Edge Covered Critical Graphs 边覆盖临界图的一些性质 短句来源 查询“边临界图”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句 没有找到相关例句 Starting from complete graph K., in this paper we give by recursive method the definitions of non-n-chromatic elementary subgraph, n-chromatic single color element and n-chromatic different color element. Then a necessary and sufficient condition for n-colorable graphs is given as follows: Graph G is n-colorable if and only if G contains no non-n-chromatic elementary subgraph. This paper provides another conclusion: G is a non-(n—1)-chromatic elementary subgraph if and only if G is a n-edge critical graph. This... Starting from complete graph K., in this paper we give by recursive method the definitions of non-n-chromatic elementary subgraph, n-chromatic single color element and n-chromatic different color element. Then a necessary and sufficient condition for n-colorable graphs is given as follows: Graph G is n-colorable if and only if G contains no non-n-chromatic elementary subgraph. This paper provides another conclusion: G is a non-(n—1)-chromatic elementary subgraph if and only if G is a n-edge critical graph. This result gives the construction of the n-edge critical graphs. 本文从完全图K_n出发,递归定义了非n色基本子图,n色同色元和n色异色元等概念,然后,给出了n-可着色图的一个充要条件:图G是n-可着色的当且仅当G不包含非n色基本子图。本文又得到一个结论:G是非n-1色基本子图当且仅当G是n-边临界图,从而给出了n-边临界图的构造。 In this paper, we have defin d total-colourable critical graph andhave proved X_T(G) = Δ(G) + 2 (for |{υ|d(υ) = Δ(G), υ∈V(G)}|≥3), where,G is a total-colourable edge critical graph, Δ(G) is maximum degree of GX_T(C) is total-colourable number of G. 本文定义了全着色临界图,并证明了对于 |{v|d(v)=△(G),v∈6V(G)}|≥3的全着色边临界图G(V.E),有 xт(G)=△(G)+2.其中△(G)表示G的最大度,xт(G)表示G的全色数. This paper gives some simple properties of P_∞-k-Edge critical graph, the foUowing results are proved: (1) If X' (G; P_∞)=k, then G contains a P_∞-L-Edge critical subgraph, where L≤k. (2) If G is a P_∞-k-Edge critical graph, H is path and HG, |H|≥1, H∈P_∞, then X' (G-H; P_∞)=k-1. 本文证明了P_∞—K—边临界图的一些简单性质。主要结果:(1)若X~-1(G;P_∞)=K,则对所有L≤K,G包含一个P_∞—L—边临界子图;(2)设G是P_∞—K—边临界图,H是G中长至少为1的路,且H∈P_∞,则x~1(G—H;P_∞)—K—1。 << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关边临界图的内容 在知识搜索中查有关边临界图的内容 在数字搜索中查有关边临界图的内容 在概念知识元中查有关边临界图的内容 在学术趋势中查有关边临界图的内容

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