The concept of square-free coloring was introduced in graph theory by Alon in 2002.
无正方形着色的概念由阿龙在2002年引入图论。
The core idea in my own theory of the emergence of collectively autocatalytic sets is simple and involves what is called a phase transition in a "random graph".
我自己的关于集体自催化系出现的理论的核心思想很简单，涉及到在所谓的“随机图”里的阶段过渡。
According to Semantic Web theory, everything - whether an object or a data graph source (also an object) - has a Uniform Resource Identifier (URI).
根据语义web理论，一切内容—无论是对象还是数据图来源(也是一个对象)—都有统一资源标识符(Uniform Resource Identifier,URI)。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
The purpose of this thesis is to collect the known results in graph theory with algebraic techniques involved.
这篇论文的目的主要是收集了已知的图论上使用的代数方法。
Objective: To present the methodology of graph theory principle coordinates analysis and explore its applicability for studying human population genetic structure.
目的：提出基因频率矩阵的图论主坐标分析方法，探讨该法在人类群体遗传结构研究中的应用。
The graph theory principle coordinates analysis is an ideality method for studying the human population genetic structure.
图论主坐标分析是分析人类群体遗传结构的一种理想方法。
The fundamental idea of dynamic modelling of complex spacecraft system using Bond Graph theory, and the procedure of using Lagrange Bond Graph are discussed.
介绍了键图理论应用于建立复杂航天器系统的动力学模型的基本思想以及拉格朗日键图的具体应用步骤。
The chromatic theory of graphs is one of the most important branches of Graph Theory.
图的着色理论是图论的重要分支之一，是图论研究中的最活跃的课题之一。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
According to the theory of graph representation and fundamental circuits, Angle speed and torque equations are presented, and method of efficiency calculation is given.
根据图表示法和基本回路理论，建立角速度和力矩方程，给出了效率的计算方法，较传统方法直观、简便。
Contexts are vital notion of the conceptual graph theory and are especially useful for packaging information.
背景在概念图理论中至关重要，其作用尤其体现在信息组织方面。
Graph theory is a very useful subject, which is widely used in manyfields, for computer technology, information theory and cybernetics.
图论是一门应用性很强的学科，在计算机科学、信息论等各个方面都有着广泛的应用。
The nine-zone graph theory is widely recognized in reactive power optimization but hard to deal with three-coil transformers.
九域图原理是电压无功控制的成熟理论，但在处理三绕组变压器时有一定的难度。
The study of factor theory of graph has been developed rapidly since 1952, we have a lot of achievements about factor theory.
自从1952年以来，对图的因子理论的研究进展十分迅速，到现在已有很多的研究成果。
An algorithm based on graph theory for non-rigid shape matching is presented.
提出了一种基于图理论的非刚体形状匹配算法。
The paper studies computer algorithm of valve shutoff in fault of heating network by graph theory, and works out applying program.
应用图论理论研究了供热管网故障时关阀方案的计算机算法，编制了实用程序。
Utilizing the shortest path algorithm in Graph Theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part.
运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。
The Bond-space theory is the development of the bond graph theory of system dynamics.
键合空间理论是系统动力学键合图理论的拓展。
This course is designed for graduate students who major in combinatorics and graph theory.
本课程是数学系研究生的专业课。它是为组合论与图论方向研究生设置的专业课程。
The coloring theory of graphs is one important branch of graph theory.
图的染色理论是图论中的一个重要分支。
Euler solved this problem in 1736. He changed this problem into the first graph theory problem by abstract analyzed method.
欧拉在1736年解决了这个问题，他用抽象分析法将这个问题化为第一个图论问题。
Described a modular design procedure of reconfigurable machine, based on screw theory and graph theory.
提出了一种基于旋量理论以及图论的可重构机器的模块化设计方法。
The paper begins with an analysis in vulnerability risk evaluation, including its theory, attack graph and specialty of vulnerability.
论文从漏洞评估的原理、攻击路径及漏洞本身，提出一种基于攻击路径的漏洞风险评估模型。
Isomorphism identification is an important and difficult problem in mechanism type synthesis, it is also one of the most difficult problems in graph theory.
同构识别是机构类型综合中一个重要而又困难的问题，同时，也是图论中非常难解决的问题之一。
The algorithm is based on the principle of flow graph theory and set theory.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
The algorithm is based on the principle of flow graph theory and set theory.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
应用推荐