助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   导出子图 的翻译结果: 查询用时:1.674秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

导出子图     
相关语句
  induced subgraph
     It is shown that let G is a connected,N 2-locally connected K 1,4 -restricted graph with δ≥6,which does not contain an induced subgraph H isomorphic to one of G 1,G 2 and G 3,then G is hamiltonian.
     证明如下结论 :设G是连通、N2 -局部连通、δ≥ 6的K1 ,4 -受限图 ,如果G中不含有同构于G1 ,G2 或G3的导出子图H ,则G含哈密顿圈 .
短句来源
     This paper proves that: if “ G ” is a 3 Connected { K 1.3 }-free graph and each induced subgraph A of “ G ” satisfies (a 1,a 2) , then G is a penconnected graph (Except for some u and v with d(u,v)=1 , there may not be any (u,v)-k path for k =2,3,4).
     证明了如果G是3连通无爪图,且G的每个导出子图A都满足(a1,a2),则G是泛连通图(除了u,v∈V(G),d(u,v)=1时,可能不存在(u,v)-k路,2≤k≤4外)
短句来源
     (3) for every induced subgraph T of G isomorphic to K_(1,3) or K_(1,3) + e,rnin{max{d_H~w(x),d_G~w(y)} : d(x,y) = 2,x,y ∈ V(T)} ≥ c/2.Then G contains either a Hamilton cycle or a cycle of weight at least c.
     (3) 对G中每一个与K_(1,3)或者与K_(1,3)+e同构的导出子图T, min{max{d_G~ω(x),d_G~ω(y)}:d(x,y)=2,x,y∈V(T)}≥c/2。
短句来源
     For any induced subgraph L in graph G, x,y∈V(L), if d L(x,y)=2max{d G(x), d G(y)} ≥|G|/2, then we say that Lpossesses the localized Fan's property.
     对图G的任一个导出子图L ,若对 x ,y∈V(L) ,dL(x ,y) =2 max{dG(x) ,dG(y) }≥ |G| / 2 ,则称L有局部Fan性质 .
短句来源
     A graph G is called claw-free if G has no induced subgraph isomorphic to K 1,3 .Let a and b be two integers with 2≤a≤b.
     若图G不含有同构于K1,3的导出子图,则称G为一个无爪图. 令a和b是两个整数满足2≤a≤b.
短句来源
更多       
  subgraph induced
     The tree T=(V_t, E_t)is a bichromatic tree subgraph in a maximal plannar graph G, in which the subgraph induced by V_t is a tree and T is a component of some bichromatic subgraph Gij of some 4-coloring of G.
     极大平面图G=(V,E)中的一个二色树子图T=(Vt,Et),其Vt在G中导出子图为树,并且图G存在至少一个四着色C,使T是该四着色一个二色子图的一个连通支.
短句来源
  an induced subgraph
     It is shown that let G is a connected,N 2-locally connected K 1,4 -restricted graph with δ≥6,which does not contain an induced subgraph H isomorphic to one of G 1,G 2 and G 3,then G is hamiltonian.
     证明如下结论 :设G是连通、N2 -局部连通、δ≥ 6的K1 ,4 -受限图 ,如果G中不含有同构于G1 ,G2 或G3的导出子图H ,则G含哈密顿圈 .
短句来源
     A graph Gis called K_1,n-free if it contains no K_1,n as an induced subgraph.
     图G称为K1,n-free图,如果它不含K1,n作为其导出子图.
短句来源
     A graph is said to be K1,n-free,if it contains no K1.n as an induced subgraph. Some sufficient conditions for the existence of [a,b]--factors in K1,n-free simple graphs are given.
     一个图称为K1,n-free图如果它不含K1,n作为其导出子图.文中讨论了K1,n-free图有[a,b]-因子的一些充分条件.
短句来源
     For an integer i and an induced subgraph L of graph G, if x,y∈V(L),d L(x,y)=imax{d G(x),d G(y)}|G|/2,then L is called possessing the property D L(i). Let C(G) be the closure of the graph G.
     对任意正整数 i,若图 G的导出子图 L的顶点满足 : x,y∈ V(L ) ,d L(x,y) =i m ax{ d G(x) ,d G(y) } |G|/ 2 ,则称 L具有性质 DL(i) .
短句来源
     A graph is called K_(1,n)-free if it contains no K_(1,n) as an induced subgraph.
     图被称为K1,n-free图,如果它不含有导出子图K1,n。
短句来源
更多       
  “导出子图”译为未确定词的双语例句
     Given n set X_1,…,X_n, a graph G with the vertex set X=U_i~n=_1X_i Called feasible graph for (X_1,…,X_n)if, for each X_i (i=1,…,n), the induced subgrapl G_i=G[X_i] of G with the vertex set X_i is connected.
     设有n个集合X_1,…,X_n,一个以X=U_(i=1)~nX_i为顶点集的图G称为是一个关于(X_1,…,X_n)的可行图,如果对每一个X_i(i=1,…,n),导出子图G_i=G[Xi]是连通的。
短句来源
     If G is a graph with induced subgraphs G1and G2, such that G = G1∪G2 and G1∩G2 = K1, we say that G is the pasteof G1 and G2 at v, where v∈V (G1∩G2), denoted by G = G1∨v G2.In this thesis, we focus on the consecutive edge-coloring problem for cacti.
     如果一个图G有导出子图G1和G2使得G = G1∪G2并且G1∩G2 = K1,则称G是G1和G2在顶点v的粘,记作G = G1∨v G2,其中v∈V (G1∩G2). 在本文中,我们研究仙人掌的连续边着色问题.
短句来源
     In[2],a kind of graph with cyclic extensibility which conneted,N_2—locally connect- ed,δ≥2 and not cortained graphs G_1 G_2 is given.
     文[2]证明了每个连通,N_2——局部连通,无爪、又δ≥2,且不含同构于G_1或 G_2的导出子图的图具有圈扩张性。
短句来源
     This paper proves that:let G be a 3-onnected K1.3graph,and if every inducde subgraph A, A of G satisfies (a1,a2),then G is panconnected(except for u and v (G)with d(u,v) = l, there may not be(u,v)- path for k=(2,3,4).
     本文证明了:如果G是3连通的无爪图且G的每个导出子图A,A~(?) 都满足ψ(a_1,a_2)则G是泛连通图(除了当u,v∈V(G),d(u,v)=1时,G中可能不存在(u,v)—k路,k∈(2,3,4)以外)
短句来源
     This paper proves that: If 'G' is a biconnected {K1.3,Z3, D}-free graph, then 'G' is a Hamilton graph (Except for G=Gi(i=1,2,)).
     本文证明了:如果G是2连通无爪图且G中不含同构于Z3.D的导出子图.则G是Hamilton图(除G≌G1.G≌G2外)。
短句来源
更多       
查询“导出子图”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  induced subgraph
A graph G is called claw-free if it has no induced subgraph isomorphic to K1,3.
      
The remnant is made of isolated vertices plus an induced subgraph we call the core.
      
A graph is said to beK1,3-free if it contains noK1,3 as an induced subgraph.
      
G is said to be kernel-perfect (KP) if every induced subgraph of G has a kernel.
      
G is said to be kernel-perfect-critical (KPC) if G has no kernel but every proper induced subgraph of G has a kernel.
      
更多          
  induced graph
=(V,E) is a 2-connected graph, and X is a set of vertices of G such that for every pair x,x' in X, , and the minimum degree of the induced graph >amp;lt;X>amp;gt; is at least 3, then X is covered by one cycle.
      
In the on-line version of the problem, the vertices v1, v2, ..., vn of G arrive one by one in an arbitrary order, and only the edges of the induced graph G[{v1, v2, ..., vi}] are known when the colour for the vertex vi has to be chosen.
      
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property.
      
For connectivity, prior work on topology control gave a polynomial time algorithm for minimizing the maximum power assigned to any node (such that the induced graph is connected).
      
A cluster is de ned as a subset of vertices, whose induced graph is connected.
      
更多          
  subgraph induced
If the maximum degree of any subgraph induced by a neighborhood of G is at most m, then the independence number of G is at least , where fm+1( x) is a function greater than 0$$
      
To locally complement a simple graphF at one of its verticesv is to replace the subgraph induced byF onn(v)={w:vw is an edge ofF} by the complementary subgraph.
      
We show that the chromatic index of G is given by , where is the maximum valency of G and is defined as (w(E(S)) being the number of edges in the subgraph induced by S).
      
It turns out that the matching number of the subgraph induced by the positive edges is the key parameter that allows us to differentiate between polynomially-solvable and hard instances of the problem.
      
In this paper, we examine a generalized vertex packing problem (GVP-k) in which k ``violations'' to the independent set restriction are permitted, whereby k edges may exist within the subgraph induced by the chosen set of nodes.
      
更多          
  induced sub graphs
This measures how close p induced sub graphs are to complete graphs.
      
  其他


On the basis of P. Kelly's theorem, in §1—§5 the writer investigates at large the r. c. from the structural form in which the(n—2)—order derived subgraphs of a n-Points graph G occur in G. With the concepts of the structural matrix, the column-symmetry-preserving rearrangement of a symmetrical matrix, etc., We first establish some proposition equivalent to the r. e. Then, from the froms of the structural matrices, we pick out some classes of graphs (which include the P. Z. Chinn's result[12]as a particular case),...

On the basis of P. Kelly's theorem, in §1—§5 the writer investigates at large the r. c. from the structural form in which the(n—2)—order derived subgraphs of a n-Points graph G occur in G. With the concepts of the structural matrix, the column-symmetry-preserving rearrangement of a symmetrical matrix, etc., We first establish some proposition equivalent to the r. e. Then, from the froms of the structural matrices, we pick out some classes of graphs (which include the P. Z. Chinn's result[12]as a particular case), of which the reconstructions are unique, and the essential diffieulties in the general case from the viewpoint of the structural matrices are analized. In §6, the reconstructions of partial labeled graphs, the problem of uniqueness of coloring graphs and the relationship between them are discussed. In §7 P. Kelly's theorem is extended to the hypergraphs. The problems and conjectures presented in this paper may stimulate a new approach to the r.c. and the problems related to it, and some of them may be of independent meaning in graph theory.

§1—§5中,在P.Kelly定理的基础上,从n点图G的所有n-2阶导出子图在G中出现的结构形式来对重构猜想作一般的探讨。使用标号图的结构方阵等概念,建立重构猜想的一些等价命题。从结构方阵的形式划分出一些重构唯一的图类(其中包括P.Z.Chinn[12]的结果),并分析一般情形的根本难点。§6中讨论部分标号图的重构与图的着色唯一性问题。§7中把P.Kelly定理推广于超图。文中各节所提出的一些问题与猜想,希望对于重构猜想提供一些新的思考途径,有些猜想在图论中有它的独立意义。

This paper presents yet another method to show that the strong perfect graph conjecture is true, when it is a plane graph.

Berge曾提出如下猜想:“一个图G是完美的当且仅当G和它的补图G的所有导出子图都不是长度大于3的奇数的圈”[1].已有证明[6],这个“猜想”对平面图是成立的.本文给出“猜想”对平面图成立的又一证法.

A graph G is called supercompact if distinct vertices have distinct closed neighborhoods. For a supercompact graph G, an edge e is called removable if G-e is supercompact. The subgraph of G induced by all removable edges is denoted by E0(G ) called the edge nucleus of G. A graph G is called summandable if V(G) can be partitioned into two non-void subsets A and B such that G is the join of G[A] and G[B]. For each integer n>l, we define Ln to be the graph with vertex set V(Ln) = {x1 ,…,xn,b1 ,…, bn, bn+1} and...

A graph G is called supercompact if distinct vertices have distinct closed neighborhoods. For a supercompact graph G, an edge e is called removable if G-e is supercompact. The subgraph of G induced by all removable edges is denoted by E0(G ) called the edge nucleus of G. A graph G is called summandable if V(G) can be partitioned into two non-void subsets A and B such that G is the join of G[A] and G[B]. For each integer n>l, we define Ln to be the graph with vertex set V(Ln) = {x1 ,…,xn,b1 ,…, bn, bn+1} and edge set E(Ln) = {xlbi |1≤i≤n} ∪ {b ibj | i≠j}. The results of this paper are the following.Theorem 1. Let G be a connected suparcompact graph with non-void edge nucleus E0. Then |V(G) | ≤2 |V(E0).| - 1,where the equality holds if and only if G is isomorphic to Ln, for some integer n>l.Theorem 2. A graph G is a supercompact summandable graph and E0 is a forest if and only if either G = {x} + P3 or G = (m{x} ∪ nP2) + (m' {x} ∪ n'P2) where m, n,m',n' are non-negative integers with m+n + m' + n'>2, m + n≠0, m'+n'≠0.

图G叫作超紧图,如果G中不同的点有不同的闭邻域,超紧图G的边e叫作可去边,如果G-e仍是超紧图,超紧图G的可去边的集合及其导出的子图都记作E_0,叫作G的边核。本文证明了超紧图G的阶数不大于2|V(E_0)|—1,,并且得到了等号成立时G的结构,作为这个结果的推论回答了Chin与Lim提出的一个问题。本文还决定了边核为林的可和超紧图的结构。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社