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

图标索引 历史查询
 

图集合
相关语句
  “图集合”译为未确定词的双语例句
     Let P~+(n) be the set of poly-cyclic graphs whose each pair of minimal cycles have no common edges and and P~+(n,m) be the graphs with m(m ≥ 1) minimal cycles in P~+(n).
     令P~+(n)表示n阶无公共边极小圈的多圈图集合,P~+(n,m)表示P~+(n)中具有m(m≥1)个极小圈的多圈图集合
短句来源
     In this paper,we describe the skeleton of a www guide system that is based on users' navigating patterns,give data structures of navigation area relationship,area similiar relationship,maximum similiar class relationship,view relationship and user similiar relationship. And we also give implementation algorithm of the system.
     本文阐述了一种基于用户浏览模式的万维网导航系统总体设计思想 ,设计了实现浏览区域关系、区域相似关系、极大相似类集合关系、视图集合关系及用户相似关系的数据结构 ,并给出系统的实现算法 .
短句来源
     Through analyzing the current version management model of PDM, a new version management model based on multicolor-map was introduced in order to acquire the integrated product design information during the whole design process. It's significant in Product Data Management. Then the version set was looked as a multicolor-map set, and the arithmetic operators of the version management model of PDM were presented.
     文中通过对现有 PDM版本关系模型的分析 ,提出了一种基于多色图的版本管理模型 ,用以反映在整个设计过程中完整的产品设计信息 ,并将版本集看作多色图集合 ,给出了该模型具体的操作方法 .
短句来源
     We suggest that Traditional Chinese Medical Prescription Formulation network can belong to the so-called "extended collaboration networks" due to the fact that it can be described by "a set of complete graphs",and therefore better described by a bi-particle graph and two more important statistical parameters namely "act-degree" and "act-size", and meanwhile their distributions can be defined.
     认为由于中药方剂网具有“完全图集合”这个拓扑特征,建议把它归入“广义合作网络”一类,从而可以使用双粒子图做更好的描述,并且定义“顶点项目度”和“项目大小”这两个更为重要的统计参量,研究它们的分布规律。
短句来源
     And it could evaluate the truth value of any Conceptual-Graphs or any set of Conceptual-Graphs by searching with a depth-search strategy.
     算法采用深度优先策略,可以实现对此模型下任一个概念图或概念图集合“真值”的识别.
短句来源
  相似匹配句对
     The S. C.
     C.
短句来源
     N(Z).
     N(Z)的和.
短句来源
     Collection Map Method of Logic Algebra
     逻辑代数的集合方法
短句来源
     A map is the set of finite layers effectually.
     任何地实质上是有限个层的集合.
短句来源
     The set
     集合(英文)
短句来源
查询“图集合”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  map set
The polygon matching approach provides only limited insight when applied to the case of the map set representing differences in classification.
      
One set (b) is based on long-term ship observations and is limited to the ocean; the second map set (a) based on an alternative data source includes the land areas.
      
A recent addition to the genome maps is an aligned comparative map set for any group of the twelve species.
      
Once a particular map set is selected, a dropdown list of all linkage groups present in the set appears.
      
The database software allows comparison among linkage groups in a map set.
      
更多          


This article presents a set of rules governing the relationship between the directed graph and the indirected graph after a brief aeeount of the two conventional approaches to this subject. It points out that a set of directed graphs could be obtained by treating an indirected edge in the indirected graph as a directed edge of arbitrary direction. In this way the basic concepts in the directed graph, such as paths and cycles, could be applied in the indirected graph as well.

本文在扼要地讨论了目前对有向图与无向图关系的两种论述方法的基础上,对有向图与无向图的关系提出了新的规则.指出将无向图中一条无向边看作方向任意的一条有向边,得到一有向图集合,从而可以将路径、循环等有向图中的基本概念借用到无向图中去

Let p,h be integers and (?)_h~1(p)the set of critically h-edge-connected graphs

令N 是正整数集合.设p,h∈N,令(?)_h~1(p)是其指数不为1的p 阶临界h 棱连通图集合,f_h~(?)(p)是一个确定的二元函数.本文证明如下结论:设h,p_0∈N,p≥4h-2,h≥4且设G 是(?)_h~1(p_0)中具有最大棱数且指数为h+1的图.如果对任何p∈N 且p

Let Ar=(a1,a2,…,ar),a'is integers≥2, r≥1. By an Ar-coloring of a graph G the authors mean a coloring of the edges of G by distinct colors c1,c2, …,cr,so that there are no complete subgraphs on ai vertices whose edges are co1ored in ci(i=1,2,…,r).Let HlN denote the set of all graphs on N vertices which do not contain comp1ete subgraph on l yertices. Let N(Ar,l) denote the minimum N so that there exists a graph G∈HlN which cannot be Ar-colored. In this paper, the authors define a kind of critica1 graphs, and then...

Let Ar=(a1,a2,…,ar),a'is integers≥2, r≥1. By an Ar-coloring of a graph G the authors mean a coloring of the edges of G by distinct colors c1,c2, …,cr,so that there are no complete subgraphs on ai vertices whose edges are co1ored in ci(i=1,2,…,r).Let HlN denote the set of all graphs on N vertices which do not contain comp1ete subgraph on l yertices. Let N(Ar,l) denote the minimum N so that there exists a graph G∈HlN which cannot be Ar-colored. In this paper, the authors define a kind of critica1 graphs, and then using the critica1 graphs of H5(N-1),construct the critica1 graphs of H5N. By proving al1 the critica1 graphs of H5(12) can be (3,3)-colorcd, the authors prove that all the graphs in H5(12) can be (3, 3)-colored, so the authors improve N((3,3),5)'s lower bound to N((3,3)5,5)≥13. Before this paper, the best bound of N((3,3), 5) is 10≤N((3,3),5)≤18. so far, l3≤N((3,3),5)≤18, given in this paper, is the best bound of N((3, 3), 5).

令阿Ar=(a_1,a_2,…,a_r),其中整数a_i≥2,r≥1.所谓图G的Ar着色即对 图G的边用不同的颜色c_1c_2,…,c_r着色,使得没有一个a_i个顶点的完全子 图的所有边都着色c_i(i=1,2,…,r).令HlN为具有N个顶点但不包含l个顶 点的完全子图的图的集合,N(Ar,l)表示G∈HlN但不能被 A 着色的图具有的 最少顶点数。本文定义一种临界图,并在此基础上利用H5(N-1)的临界图构造H5N 的临界图。通过证明H5(12)的临界图均能(3,3)着色,证明H5(12)中的图均能(3,3) 着色,进而得出:13<N((3,3),5)<18,优于前人得出的10<N((3,3),5)<18的结 果.

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

 


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

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