全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 infinite graph 的翻译结果: 查询用时：0.212秒
 在分类学科中查询 所有学科 数学 更多类别查询

 历史查询

 infinite graph 无限图(3)
 无限图
 A diagram of complete bipartite graph(infinite graph of n≥6) 完全二部图(n≥6的无限图)的线图 短句来源 The distance graph G(Z,D) , with a distance set D , is the infinite graph with vertex set Z={0,±1,±2,...} in which two vertices x and y are adjacent iff y-x∈D . 距离图G(Z ,D)是具有顶点集Z ={ 0 ,± 1,± 2 ,… }、距离集D ,且满足顶点x与y相邻的充要条件是y -x∈D的无限图 . 短句来源 It is proved that the diagram of complete bipartite graph(infinite graph of n≥6)is Pancyclic graphs,the line graph of further complete bipartite graph(infinite graph of n≥6) is extendable graph. 证明了完全二部图(n≥6的无限图)的线图是泛圈图,进一步完全二部图(n≥10的无限图)的线图是可扩圈图。 短句来源
 相似匹配句对
 [s,t]-GRAPH [s,t]-图及其Hamilton性 短句来源 On the characterization of period graph of the irreducible infinite Boolean matrix 关于不可约无限布尔方阵的周期的图论刻划 短句来源 On D-cyclic in Graph 关于图中的支配圈 短句来源 Infinite Graphs Made by Basic Graph of A(H)=3 由A(H)=3图的基础图构造的无限图族 短句来源 On Infinite Melodies 《无限曲》及其影响 短句来源

我想查看译文中含有：的双语例句

 infinite graph
 It is shown that every (infinite) graph with a positive Cheeger constant contains a tree with a positive Cheeger constant. We show that the cover-index of an infinite graph can be expressed in terms of colouring properties of its finite subgraphs when the minimum degree of the graph is finite. For an infinite graph, we introduce the notion of spherical functions. On a class of packet-switching networks on an infinite graph The system of equations describing a discrete field on an infinite graph with values in a complete Riemannian manifold is considered. 更多
 In this paper Qin′s Jar-metric principle has been generalised. At first We give several concepts topological semi-field, infinite modulo-sum and modulo-operator, then establish a jar-metric principle for the well-behaved jar-metric n-stage directed (infinite) graph. 文章把秦裕瑷提出的嘉量原理推广到无穷情况,首先引入了拓扑半域和无穷摹和等概念,讨论了它们的性质.作为摹矩阵的推广,文章还定义了摹算子,指出摹算子乘法结合律不是无条件的. 在此基础上,研究点和弧允许为无穷集的多阶段赋嘉有向图,定义了良性和强良性概念,把秦的嘉量原理推广到无穷的多阶段良性赋嘉有向图的情况.讨论了嘉量原理应用于状态集为无限集的动态最优化问题. In this paper the Jar-metric principle for the jar metric n-stage directed(infinite)graph has been discussed,which jar-metric is given by a map to ametric semi-field or a ordered topological semi-field. 本文引入度量半域、序性拓扑半域等概念,对于无限状态集的情况进一步讨论以度量半域或序性拓扑半域赋嘉量的 n 阶段赋嘉有向图的嘉量原理。 This paper enlarged some results on infinite graphs of the authors Konig, Rao, Euler, and Nash-Williams, and greatly reduced their proofs by Nonstandard Analysis. We also made a new Characterization of Hamiltonian property no matter what the vertex set V may be. 本文使用非标准分析方法,把Konig,Rao,εuler和Nash-williams关于无限图的结果给予推广并对证明进行了极大的简化。对Hamilton性作了新的探索。 << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社