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

图标索引 历史查询
 

local subgraph
    很抱歉,暂未找到该词条的译词。
相关语句
  相似匹配句对
     Reconstuctibility of K-Distance-Local Subgraphs Rooted at a Subgraph
     以子图为根的k距局部子图的可重构性
短句来源
     LOCAL NEWS
     地方科技动态
短句来源
     LOCAL POLICY
     地方新政
短句来源
     The Shortest Path Subgraph
     最短路径子图
短句来源
     (k,r)-Orthogonal (g,f)-Factorizations of Subgraph
     具有(k,r)-正交的(g,f)-因子分解的子图
短句来源
查询“local subgraph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  local subgraph
A canonical numbering scheme for the fragments and the local subgraph of the molecular graph enables fragments to be placed efficiently onto the molecular graph.
      


A k -local subgraph of graph G at a vertex v , denoted by L G k(v) , is a subgraph of G rooted at v and induced by the set {x∈V(G): d G(v,x)k} . In this paper, a special kind of spanning graphs, called weighted nuclear subgraphs is introduced and it is proved that the number of k -local subgraphs of G which are isomorphic to a given local subgraphs is reconstructible, if the number of vertices of every k -local subgraph of G is less than υ(G) ....

A k -local subgraph of graph G at a vertex v , denoted by L G k(v) , is a subgraph of G rooted at v and induced by the set {x∈V(G): d G(v,x)k} . In this paper, a special kind of spanning graphs, called weighted nuclear subgraphs is introduced and it is proved that the number of k -local subgraphs of G which are isomorphic to a given local subgraphs is reconstructible, if the number of vertices of every k -local subgraph of G is less than υ(G) . This improves the main result in a previous paper published by the same authers in 1996, and as a consequences of this new result, we know that the radius of a graph is reconstructible.

本文研究局部子图的可重构性.一个图G在一顶点v处的k-局部子图是到v距离小于等于k的顶点导出且以v为根的子图,记为LkG(v).本文通过引进核子图的结构证明了k-局部子图是可重构的,如果每一个k-局部子图所含的顶点数都小于等于|V(G)|-1.这个结果改进了原有的结果.由这个新结果可知,图的半径这个参数是可重构的.本文还提出了点距序列的概念,并进一步讨论了点距序列与局部子图的关系和一些未解决的问题.

In this paper a kdistance-local subgraph rooted at a subgraph is defined and it is proved that the number of k distance-local subgraphs of a graph G which are isomorphic to a given k distance-local subgraph rooted at a subgraph is reconstructible.Therefor the result in are generalized.

本文定义了图中以某个图为根的k距局部子图 ,证明了图中同构于上述k距局部子图的子图的数目是可重构的 ,从而给出了一个新结果并推广了文献[5] 中的定理 .

 
图标索引 相关查询

 


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

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