查询词典 connected graph

The current are outputted to the electric engine after capacitance commutation, N pairs of electric engine coils are connected in series by two, 2N coil diodes are connected together with reversal direction; N PNP type triodes are connected together on the N pairs of electric engine coils in series; 2N switcher are connected at the lower part of the N pairs of electric engine coil in series; 2N the first one-way diode are connected between the PNP type transmitting pole and the drain electrode of the switchers; N the second one-way diodes are connected together between the collecting electrode of PNP type triode and the source electrode of 2N switcher.

电流经串联电容整流后输给电机，N双的电机线圈二二并联，2N个线圈二极管相互反方向连接；N个PNP型三极管串联在N双的电机线圈的上部；2N个开关器件串联在N双的各个电机线圈的下部；2N个第一单向二极管接在各PNP型三极管的发射极和各开关器件的漏极之间；N个第二单向二极管接在N个PNP型三极管的集电极和2N个开关器件的源极之间。

Let be the maximum degree of a vertex in graph . Chen et al. conjectured that a connected graph is equitable -colorable if is not a complete graph , or an odd cycle , or a complete bipartite graph for all .

令 表图上的点的最大度数，陈伯亮等人，提出以下这个猜测：如果一个连通图不是，这三类的话，则可以用个颜色来均匀著色。

Let G be a connected and simple graph with p order, the complement graph G is the union of a complete bipartite graph K n,m and an empty graph K.

设G为p 阶连通简单图，其补图G为完全偶图Kn，m 及空图K的并，笔者利用完全偶图的谱的特性，获得了图G的特征根分

E. MCNG-ISOMAP (Minimal Connected Neighborhood Graph-based ISOMAP), which can prune effectively "shortcut" edges, existed possibly in the neighborhood graph, based on that the minimal connected neighborhood graph can avoid "shortcut" edges effectively.

该算法能在一定程度上避免邻域大小难以有效选取的问题，同时还能在不依赖于邻域大小的情况下发现数据真正的固有维数。

We study the recursive structure of the twisted-cube connected network sufficiently, and prove that the twisted-cube connected network is an n regular graph with connectivity n: point out that the twisted-cube connected network is a cube-free network, which is an essential distinction with the hypercube and other variations of the hypercube; prove that the diameter of n dimensional twisted-cube connected network is [ (n+1)/2] , which is almost the half of hypercube's.

首先对其结构的递归性进行充分地研究，证明它是连通度为n的n正则图；指出扭立方体连接网络无立方体子图，这是扭立方体连接网络与超立方体及其其它变种的本质差别；证明了n维扭立方体连接网络的直径为[（n+1）/2]，它几乎是超立方体直径的一半；最后，给出超立方体及其变种的等价定义，并对它们的结构递归性、网络参数和拓扑性质等作了简单的分析、综合和比较。

In the invention, the water outlet of a circulating pump is connected with the water inlet of a solar energy collector; a water check valve is arranged on a water circulating pipe between the water outlet of the circulating pump and the water inlet of the solar energy collector; the water outlet of the solar energy collector and the water outlet of a water supply pump are connected with the water inlet of a heating coil; the water inlet of the circulating pump and the water inlet of a drain pump are connected with the outer outlet of the heating coil; the water inlet of the water supply pump is connected with the water outlet of a water storage tank; and the water outlet of the drain pump is connected with the water inlet of the water storage tank.

本发明的循环水泵的出水口与太阳能集热器的入水口连接，水止回阀设置在循环水泵的出水口与太阳能集热器的入水口之间的水循环管路上，太阳能集热器的出水口和补水泵的出水口都与加热盘管的入水口连接，循环水泵的入水口和泄水泵的入水口都与加热盘管的出水口连接，补水泵的入水口与储水箱的出水口连接，泄水泵的出水口与储水箱的入水口连接。

The line graph of further complete bipartite graph(infinite graph of n≥6) is extendable graph.

进一步完全二部图(n≥10的无限图)的线图是可扩圈图。

One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.

其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。

Graph theory and topology was researched to establish graphic interpreter, boolean multiplication ⊙ of a matrix is inferred and defined, and simple sub-graphs are disconnected from complex graph by the multiplication ⊙; parameterization of graph is realized through a sequence of sub-graph entities linked by constraints.

研究了图形翻译器的图论和拓扑学理论基础，推出并定义了矩阵布尔乘运算〓，使用矩阵运算〓将复杂的图形拆分成一系列简单子图；以约束关联的子图实体序列实现图形的参数化。

It allows each edge of a graph data set to be with different interval-gap value. For example, given a graph with n edges, the interval-gap concept provides n interval-gap values, Min_Gap and Max_gap, for these edges correspondingly. By incorporating this concept into the graph mining, discovering frequent sub-graph with time constraints can be more effective.

在本论文中提出了区间间隙的概念，主要即是由固定的Min_Gap、Max_gap将之修改调整为弹性的Min_Gap与Max_gap，此区间间隙弹性的地方即在於图形资料集里的任两个节点所串连的边皆会有不同的区间间隙，也就是一个具有n个边的图形里，将会有n个不同的区间间隙值，也就是Min_Gap与Max_gap，这样的作法对於具有时戳性质的图形探勘将更有效益

"Second Life is remarkably easy to work with, and is very popular,"

"第二次生命是显着容易的工作，并且很受欢迎，"

For example, we usually assume that materials are homogeneous and isotropic and free of internal defects or flaws.

为了得到适合有限元分析的模型，我们必须经过如图2所示的简化步骤。