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

图标索引 历史查询
 

simplicial graph
相关语句
  “simplicial graph”译为未确定词的双语例句
     When the order of a 2 connected cubic simplicial graph is not zero modulo three,it is found that its maximum genus is at least one third of its cycle rank plus one.
     同时 ,还证明了当节点数不可被三整除时 ,这种图最大亏格的下界可提高一个亏格 .
短句来源
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     X Graph and Its Properties
     X图及其性质
短句来源
     New Exploration on the Simplicial Method
     对单纯形法的新探讨
短句来源
     On Several Inequalities of Simplicial Matrix
     一类单纯阵的若干不等式
短句来源
     Homotopy theory of presheaves of simplicial
     单纯广群的准层和同伦纤维
短句来源
查询“simplicial graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  simplicial graph
Given a finite simplicial graph ?, and an assignment of groups to the verticles of ?, the graph product is the free product of the vertex groups modulo relations implying that adjacent vertex groups commute.
      
Let be a finite simplicial graph, the flag complex induced by , and the graph group, or 'right angled Artin group', defined by .
      
A graph group presentation corresponds in a natural way to a simplicial graph, with each generator corresponding to a vertex, and each commutator relator corresponding to an edge.
      
A finite simplicial graph Γ determines a right-angled Artin group GΓ, with generators corresponding to the vertices of Γ, and with a relation υw=wυ for each pair of adjacent vertices.
      
In this paper, the relationship between non-separating independent number and the maximum genus of a 3-regular simplicial graph is presented.
      
更多          


It is shown that the smallest order of a non upper embeddable 2 connected 3 regular simplicial graphs is eighteen. In other words, all 2 connected 3 regular simplicial graphs with order less than eighteen is up embeddable.

证明最小的不可上嵌入的二连通三正则简单图有18个点.换言之,点数小于18的所有二连通三正则简单图是上可嵌入的.

Abstract In this paper, the relationship between non separating independent number and the maximum genus of a 3 regular simplicial graph is presented. A lower bound on the maximum genus of a 3 regular graph involving girth is provided. The lower bound is tight, it improves a bound of Huang and Liu.

§1IntroductionThemaximumgenusofaconnectedgraphG=(V,E),denotedbyγM(G),isthemax-imumintegerkamongthegenerasuchthatthereisanembe...

It is known that the lower bound on the maximum genus of a 2 connected cubic simplicial graph is at least one third of its cycle rank.This bound is tight.This paper has showed that there is a special structure in such a graph that its maximum genus attains the lower bound,and the order of such a graph is zero modulo three.When the order of a 2 connected cubic simplicial graph is not zero modulo three,it is found that its maximum genus is at least one third of its cycle rank plus one....

It is known that the lower bound on the maximum genus of a 2 connected cubic simplicial graph is at least one third of its cycle rank.This bound is tight.This paper has showed that there is a special structure in such a graph that its maximum genus attains the lower bound,and the order of such a graph is zero modulo three.When the order of a 2 connected cubic simplicial graph is not zero modulo three,it is found that its maximum genus is at least one third of its cycle rank plus one.

已知二连通三正则简单图的最大亏格至少为其圈秩的三分之一 .且 ,此下界可以达到 .本文表明这种达到最大亏格下界的图具有特殊结构 ,而且其节点数可被三整除 .同时 ,还证明了当节点数不可被三整除时 ,这种图最大亏格的下界可提高一个亏格 .

 
图标索引 相关查询

 


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

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