查询词典 complementary graph

Kinematic and kinetic analysis problems are discussed using topological graph and signal current graph. Research on the generality of EGTs is completed elementally and the occurrence condition of circulated power in EGTs is derived.

8运用拓扑图和信号流图探讨运动学和动力学分析的问题，初步完成对周转轮系的共性方面的研究工作，讨论了周转轮系的循环功率产生条件。

Knauer in 1990 first defined the endomorphism spectrum and the endomorphism type of a graph to study the algebraic structure which is put on a graph by this various endomorphisms.

德国数学家Knauer于1990年在文献[1]中首次提出了自同态谱和自同态型的概念，目的是通过图的各种不同的自同态来研究图的代数结构。

This paper shows that if graph G is 2-connected, we may just use Euler"s formula and the graph"s structural

本文指出，对于2-连通图，只用欧拉公式和图的结构性质就能证明这些以及其它的一些结果。

Ava Universal Network/Graph Framework - JUNG provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network.

UNG 提供了一个公共的可扩展的语言来建模、分析和可视化数据，数据可以通过图形或网络来提供。

In the framework of graph embedding, it shows that the proposed algorithms have correspondingly extensional type of graph embedding and applicability.

在图嵌入框架下，对本文提出的算法进行了分析和比较，表明了提出的算法具有相应的图嵌入扩展方式和适用性。

This paper introduces basic concepts, representation methods and practiCal applications of computer internal division graph and external divistion graph, and presents a linear mapping method of representing internal divisio.

计算机内插图形和外插图形是计算机图形学中由图形生成图形的两种基本方法，用该方法可以生成许多有趣的图形、图案，在计算机动画模拟图案设计中有着广泛的应用。

In section four, by researching the properties of Kneser graphs, we construct the homomorphism φ between the Kneser graph and the outerplane graph. So the fractional chromatic number and chromatic number are obtained.

在第四部分中通过对Kneser图的一些性质的考察，在Kneser图与外平面图之间建立同态关系，从而得到了外平面图的分数色数与顶点色数。

A geometric structure representation of images based on the angle between spectral coefficient vectors of Laplacian graph was proposed. Graph clustering of spectral features was also investigated.

提出一种用拉普拉斯图的谱系数夹角谱特征来描述图像几何结构的方法，同时研究了基于图的谱聚类系统。

Graph coloring problem is a classic difficult problem of graph theory. It is a fundamental problem in scientific computation and engineering design.

图的染色问题是图论中的一个经典难题，它也是科学计算与工程设计中一个重要和基本的问题。

Graph coloring problem is a NP-complete one of graph and combinatorial optimization.

图着色问题是图与组合优化中的一个NP-完全问题。

I can do simple painting, carpentry and plumbing.

我能做简单的油漆、木工和修水管等工作。

The motivations, notations and outline of this work are also given in this chapter.

从这个意义上讲，这些时滞是无害的。然后用实例说明这三个定理的应用和互不包含性。