查询词典 complementary graph

Grouped by the display mode, this paper dividually discusses the color-map graph, various curve graph, warpage result display.

按照查看数据结果的方式分类，作者分别阐述了颜色映射模式下数据场的显示、各种曲线图的显示、翘曲变形的显示。

Based on predecessors research findings, the quality of different kinds of research techniques are compared and induced. Concerned with using graph to type and scale synthesis, topological graph based upon functional fractionation is presented, the combination, evolution and inversion regularities of epicyclic gear trains are researched in detail. The synthesis problems of general and overlapping EGTs are solved. The method may be applied into the innovation design of EGTs.

本文在前人的研究成果的基础上，比较归纳各种研究方法的优劣，考虑到将图应用于型综合和尺度综合两方面，提出基于功能离散法的拓扑图，深入研究周转轮系组合、演化、反演等规律，解决了一般和重叠式周转轮系的综合问题，可应用于周转轮系的创新设计。

The symbolical, decorative, subjective and formulistic theory and technique are widely applied in modern plane design. The longitudinal and transverse inheritance of the traditional graph is also discussed in the thesis. Modern art design tries to inherit the essence of traditional graph by making use of its form.

传统图形色彩的象征性、装饰性、主观性、程式化的色彩学理论与技术被广泛应用于平面设计中；本文同时讨论了传统图形在平面设计中的纵向与横向的传承，在现代艺术设计中对传统图形取其形、达其意、传其神；中华民族长期以来既创造了浩如烟海的图形精品，也创立了包括哲学思想、构图意蕴、构成法则、色彩学等完整的艺术设计理论体系。

In this paper, a new type of network graph, in which all transmission paths are oriented and the weight for an arbitrary pair is not the same as for the pair, is defined as an inversable and weight-varied oriented network graph.

本文提出了一种可逆变权有向网络图，在这种网络图中，任意顶点对权与顶点对的权都不同。

Adjacent and nonadjacent mapping algorithms based on task graph and topology graph are designed for multi-dimensional mesh and a two-level mapping algorithm for two-level hybrid topology.

为多维mesh设计了无连通和连通映射算法，并为二级混合型结构设计了基于任务图分级的二级映射算法。

Also,we prove that for a 2-connected weighted graph,if〓 for every pair of nonadjacent verticesu and v,then the graph contains either a Hamilton cycle or a cycle of lengthat least c and weight at least s.

同时，我们还证明了：如果在一个2连通赋权图G中，对于每一对不相邻的顶点u和v，有〓和〓，那么G或者为Hamilton图或者包含一条长度至少为c，且权至少为s的圈。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows:(1) Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable.(2) Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,d+d≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下：(1)若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的；(2)若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，d+d≥2n+3，则G是导出匹配可扩的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows 1 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable. 2 Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,du+dv≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下 1若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的 2若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，du+dv≥2n+3，则G是导出匹配可扩的。

The matrix equation of the sectorial coordinate has been deduced by making use of the graph theory and energy principle after creating the graph model of the box girder section.

利用图论的基本原理建立箱梁断面的图论模型，并结合能量原理，推导出求解扇性坐标的矩阵方程。

A regular G— edge-transtive but not G—vertex-transtive graph will be refered to as a G—semisymmetric graph .

一个正则的G-边传递而非G-点传递的图称为G-半对称的。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样