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

图标索引 历史查询
 

adjoint equivalent
相关语句
  伴随等价
     Let G∨H denote the join of two disjoint graphs G and H.In this paper,we obtained the formula of the adjoint polynomial of G ∨ H.Some conditions for two adjoint equivalent graphs will be given also.
     设G∨H表示两个不相交图的的联图〔1〕,本文给出了G∨H伴随多项式的计算公式,且得到了若干伴随等价图的构造方法。
短句来源
     If h(G,x)=h(H,x), then G and H are adjoint equivalent;
     若h(G,x)=h(H,x),称G和H伴随等价;
短句来源
     G and H is chromatically equivalent if and only if and are adjoint equivalent;
     G和H色等价当且仅当G和H伴随等价; G色惟一当且仅当G伴随惟一.
短句来源
     Adjoint Equivalent Graphs About a Certain Type of 3-Ary Trees
     一类三叉树的伴随等价图(英文)
短句来源
     The theory of adjoint polynomials is first offered by Liu Ruying[Discrete Math.,1997,172:85-92],which can be used to research the chromaticity of dense graphs. By using the above theory,especially minimum roots[Discrete Math.,2004,281:277-294],the paper completely characterizes all graphs having the same adjoint equivalent classification with a certain type of 3-ary trees.
     通过运用由刘儒英教授提出[参见离散数学,1997,172:85-92]的伴随多项式理论和最小根定理[参见离散数学,2004,281:277-294],给出了一类三叉树的伴随等价图.
短句来源
  相似匹配句对
     the equivalent of E.
     E.
短句来源
     If h(G,x)=h(H,x), then G and H are adjoint equivalent;
     若h(G,x)=h(H,x),称G和H伴随等价;
短句来源
     G and H is chromatically equivalent if and only if and are adjoint equivalent;
     G和H色等价当且仅当G和H伴随等价; G色惟一当且仅当G伴随惟一.
短句来源
     is equivalent to the symbol ?
     熟知其可逆性,Fredholm性等价于符号?
短句来源
     ADJOINT POLYNOMIAL OF GRAPHS
     图的伴随多项式
短句来源
查询“adjoint equivalent”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


Let G∨H denote the join of two disjoint graphs G and H.In this paper,we obtained the formula of the adjoint polynomial of G ∨ H.Some conditions for two adjoint equivalent graphs will be given also.

设G∨H表示两个不相交图的的联图〔1〕,本文给出了G∨H伴随多项式的计算公式,且得到了若干伴随等价图的构造方法。

Let Gr be the graph consisting of star graph S r+1 and the r′s copies of any graph G by coincidin g a same vertex of G with a vertex of degree 1 of star graph S r+1 ,and Let Hr be the graph consisting of star graph S r+1 and a ny graph G by coinciding a vertex of G with the vertex of degree r of S r+1 , if G not contain triangle, then Gr∪(r-1)K 1 and (r-1)G∪Hr adjoint equivalent. Hence its complement graph that be chroma tic equivalent.

记 Gr为任意图 G的 r个拷贝中的对应点 ( r个 )分别与星图 Sr+ 1 的 r个 1度点粘接后得到的图 ,又记 H r为该图 G的相应点与星图 Sr+ 1 的 r度点粘接后得到的图 .如果 G不含三角形 ,则图 ( r- 1) K1 ∪ Gr和图 ( r- 1) G∪ H r伴随等价 ,进而它们的补图色等价

Let h(G,x) denote the adjoint polynomial of a Graph G. The chromatic uniqueness and chomatic equivalence from the complement of Graph G are studied. If P(G,λ)=P(H,λ), G and H are called chromatic equivalence. A graph is called chromatic uniqueness, if P(G,λ)=P(H,λ), then GH. If h(G,x)=h(H,x), then G and H are adjoint equivalent; G and H is chromatically equivalent if and only if and are adjoint equivalent; G is chromatic unique if and only if is adjoint unique. U_n is a tree with two...

Let h(G,x) denote the adjoint polynomial of a Graph G. The chromatic uniqueness and chomatic equivalence from the complement of Graph G are studied. If P(G,λ)=P(H,λ), G and H are called chromatic equivalence. A graph is called chromatic uniqueness, if P(G,λ)=P(H,λ), then GH. If h(G,x)=h(H,x), then G and H are adjoint equivalent; G and H is chromatically equivalent if and only if and are adjoint equivalent; G is chromatic unique if and only if is adjoint unique. U_n is a tree with two vertices of degree 3 and four vertices of degree 1 obtained from path P_ n-4 by adding two hanging edges of every vertex of degree 1. K-_4 is a graph in which an edge is removed from K_4. The coefficient of adjoint polynomial and the property of its root about graph U_n∪K-_4 are discussed on the basis of the theory of adjoint polynomial, and its chromatically equivalent classes are characterized.

h(G,x)表示图G的伴随多项式,它从图G的补图出发研究色惟一和色等价.若P(G,λ)=P(H,λ),称G和H色等价.一个图被称为是色惟一的,如P(G,λ)=P(H,λ)意味着GH.若h(G,x)=h(H,x),称G和H伴随等价;G和H色等价当且仅当G和H伴随等价;G色惟一当且仅当G伴随惟一.Un表示从路Pn-4的每个1度点分别引出两个悬挂边所得到的具有两个3度点4个1度点的树.K-4表示从K4中删去一条边得到的图.应用伴随多项式理论研究了图Un∪K-4的伴随多项式系数和根的性质,以此为基础刻画了图Un∪K-4的色等价图类.

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

 


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

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