Chinese translation for "图的一种"

logical line of visibility chart

Example Sentences:

	1.	A new method for reading the complicated assembly - drawings 复杂零件读图的一种新方法
	2.	Tower graph a kind of extended hamiltonian graph 汉密顿图的一种扩展图
	3.	When the scale of red green and blue is the same , it is called the grayscale image 灰度图像也是彩色位图的一种，即红、绿、蓝的灰度值相等。
	4.	The data flow testing of class is analysed , and the data definition - use pair is explanated . an algorithm to structure control procedure chart of class is offered 摘要分析类的数据流，说明数据的定义使用对；给出构造类的控制流图的一种算法。
	5.	A new method for proving the chromatically non - unique graphs is given by studying factorization their adjoint polynomials , and some structure characteristic is obtained 摘要通过研究图的伴随多项式，给出了证明非色唯一图的一种新方法，并且得到了若干图簇的色等价图的结构性质。
	6.	In this paper , the properties of the maximal critically 4 - connected are iscussed and a new procedure for constructing the maximal critically 4 - connected graph is determined by means of graphical pasting 摘要引入图的粘合的概念，讨论了极大临界4连通图的性质，给出了一个图是这类图的一个充分必要条件，由此给出该类图的一种新的构造方法。
	7.	In the 3rd chapter , according to the requirement of the representation of the product information , a new data model - xoem ( extensive object exchange model ) is presented because of the lack of the data model , which faces to the xml . the formal description of the xoem and its corresponding algebra are put forward , and then the data model is applied to the xml document on the web . in the 4th chapter , the method of the uniform information representation is presented according to the requirement of the description and identification of the diversified heterogeneous product information 在第三章中，结合产品信息网上表达的需求，针对www环境下缺乏面向产品信息xml描述的web数据模型的情况，提出了基于带根连通有向图的一种新的数据模型即可扩展对象交换模型xoem ( extensiveobjectexchangemodel ) ，给出了该模型严格的形式化描述，并将该模型应用到含有xml半结构化数据的web中。
	8.	The thesis consists of two parts . the first introduces the . definition of new decomposition - ascending subgraph decomposition ? the currently - achieved main research achievements and the development direction of research . the second mainly researches the problems about ascending subgraph decomposition of size < 21 第一部分介绍了图的一种新分解? ?升分解的概念，归纳总结了目前所得到的主要研究成果和研究的发展方向；第二部分着重研究了具有小于21条边的所有图的升分解问题，从而证明了q 21的图可以升分解。
	9.	In the first chapter , the background and some basic results are introduced . in the second chapter , we study higher order edge connectivity , and obtained ( a ) except for three graphs , all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs , all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs , in particular , necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given 第二章中，我们研究高阶边连通度，得到了如下结果： ( a )除了三个特殊图外，所有具有有限跃阶的无限循环图都是超边连通的； ( b )除了三种特殊图类外，所有边传递图都是最优- ~ ( 3 )图； ( c )刻划了点传递图的最优- ~ ( 3 )性，特别是给出了cayley图和极小cayley图为最优- ~ ( 3 )图的充分必要条件； ( d )给出了一个图(不一定是对称图)是最优- ~ ( 3 )图的一种充分条件。

Similar Words：

"图的起点" Chinese translation, "图的启发式函数" Chinese translation, "图的深度" Chinese translation, "图的生成" Chinese translation, "图的使用者" Chinese translation, "图的整饰" Chinese translation, "图的中心" Chinese translation, "图的终点" Chinese translation, "图的祖先节点" Chinese translation, "图登" Chinese translation