查询词典 connected graph

The dissertation details the functions and characteristic of curves graph element, polygon graph element, character graph element, dimension graph element, parameter graph element, self-define graph element, and research comprehensively the methods describe and graph element attrib. After discussing the basic graph element collection, this thesis gives the description method, organization way, graph element visitation, save and load efficiency, suitability and so on of every element in the basic graph element collection in greater detail. The author provides a graph element data structure organized version which is length changeable and is a block storage record, and designs a new module of data, which can process both the geometry attrib and no geometry attrib of drawing element. Based on this, the data model of all kind of element is put forward.

对采矿CAD系统中基本图元集的构造原则和组织方法进行了研究，提出了一个7元素采矿CAD基本图元集构造方案；论文详细讨论了曲线图元、字符图元、尺寸标注图元、多边形图元、参数图元、自定义图元在采矿CAD系统中的作用和特点，并对各种图元的表述方法和图元属性及相应的库组织方式、存取效率进行了深入的研究，提出了一个&可变长记录块&图元库结构组织方案；通过对采矿CAD系统中基本图元数据模型的构造方法、存取结构和访问方式的研究，给出了一个用C++语言描述的采矿CAD系统基本图元数据模型及其数据存取结构。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

After being connected with a resistor in series, the primary input end of a transformer is connected with the output end of the live wire and the output end of the null line in parallel, the secondary output end is connected with the two ends of the earth wire switch in parallel after being connected with another resistor in series, one end of a neon lamp in a photoelectric coupler is connected with the input end of the earth wire E and a secondary end of the transformer, the other end of the neon lamp is connected with the centers of the two resistors, one end of a light sensitive resistor in a photoelectric coupling switch is connected with the anode of an integrated circuit power in the creepage protector, the other end of the light sensitive resistor is connected with the anode of a diode, the cathode of the diode is connected with the triggering pole of the silicon-controlled rectifier in the creepage protector, the neon lamp and the light sensitive resistor are positioned into a dark box, and a small hole which avoids the light sensitive resistor is formed on the dark box.

防止地线触点未导通的全能安全插头，包括各带开关的地、零、相三线接线和由零序互感器、脱扣器、放大器、整流器、试验回路和可控硅组成的漏电保护器，变压器初级输入端串联电阻后并接在火线输出端和零线输出端，次级输出端与电阻串联后并联在地线开关两端，光耦内氖灯的一端与地线E输入端和变压器次级的一端连接，氖灯另一端与二电阻的中心连接，光电耦合开关内光敏电阻的一端与漏电保护器内的集成电路电源正极连接、光敏电阻的另一端与二极管的正极连接，二极管的负极与漏电保护器内的可控硅触发极连接，氖灯和光敏电阻置于暗箱中，暗箱上开一避开光敏电阻的小孔。

In the special case when G = AutX, we call a G—vertex-transtive graph, G—edge-transtive graph, G—semisymmetric graph X is vertex-transtive edge-transtive semisymmetric graph respectively In this paper we investigate the autmorphism graph AutX of the cubic semisymmetric graph of order 12p ,when p is primes.

特别地，若G=AutX这时的G-点传递图、G-边传递图、G-半对称图称为点传递图边传递图半对称图。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

Firstly, the connection matrices are strongly connected Boolean matrix, it is shown that the maximum length of limit cycles for FBAM is the period index of the product of the connection matrices. Thus, the maximum limit cycle is reachable. Secondly, two strongly connected components are connected by walks, it is proved that the maximum length of limit cycles for FBAM is the max. of the period index of the two strongly connected components if they are prime, otherwise, it is the least common multiple of the two period index. Finally, n strongly connected component are connected in succession, the method for computing the maximum length is described. By different patterns are presented to the networks, diminishing the number of the strongly connected components until only two components.

第一，连接权矩阵为强连通布尔矩阵，此时模糊双向联想记忆网络的最大极限环长度为连接权矩阵乘积的周期指数，从而极限环具有可达性；第二，两个强连通分支有路径连接，此时如果两个强连通分支的周期指数互素，那么网络的最大极限环长度为其最大者，否则，网络的最大极限环长度就等于二者的最小公倍数；第三，n个相邻强连通分支有路径连接，给出了计算最大极限环长度的方法，通过激发模式的变化，逐渐减少强连通分支的个数，直到只有两个分支。

A resistor is connected between the output end of the live wire and the output end of the earth wire, another resistor is connected between the output end of the null line and the input end of the earth wire, a neon lamp in a photoelectric coupling switch is connected at the two ends of the earth wire switch in parallel after being connected with the resistors in series, one end of a light sensitive resistor in the photoelectric coupling switch GR2 is connected with the anode DC+ of an integrated circuit IC power in the creepage protector, the other end of the light sensitive resistor is connected with the anode of a diode D3, the cathode of the diode D3 is connected with the triggering pole of the silicon-controlled rectifier SCR in the creepage protector, the neon lamp and the light sensitive resistor are positioned into a dark box, and a small hole which avoids the light sensitive resistor is formed on the dark box.

一种防止地线触点未导通的全能安全插头，包括各带开关的地、零、相三线接线和由零序互感器、脱扣器、放大器、整流器、试验回路和可控硅组成的漏电保护器，所述的火线输出端、地线输出端间连接电阻，所述的零线输出端、地线输入端间串接电阻，光电耦合开关内的氖灯与电阻串联后并联在地线开关两端，光电耦合开关GR2内光敏电阻的一端与漏电保护器内的集成电路IC电源正极DC＋连接、光敏电阻的另一端与二极管D3的正极连接，二极管D3的负极与漏电保护器内的可控硅SCR触发极连接，氖灯和光敏电阻置于暗箱中，暗箱上开一避开光敏电阻的小孔。

Graph theory s 02 graph theory widely used for its own development. 40-60 20th century era matroid theory and graph theory-very graph theory, algebra and graph theory. topology theory has great development.

详细说明：图论讲义02 图论的广泛应用，促进了它自身的发展。20世纪40-60年代，拟阵理论、超图理论、极图理论，以及代数图论、拓扑图论等都有很大的发展。

Moreover, the range of m is obtained when G is a forest, a unicyclic graph, a bicyclic graph, a tricyclic graph and a tetracyclic graph, respectively, and the graph is determined when m(≥1) takes different value in its range.

给出了当G是森林、单圈图、双圈图、三圈图、四圈图时m的取值范围，并确定了m(≥1)在该取值范围内取不同值时的所有图。

The invention provides a dual redundant CAN bus controller, which is arranged on a crewel CAN bus, characterized in that: two CAN bus transceiving modules, two initializing modules are respectively corresponding to the CAN bus controller module A and CAN bus controller module B; the two CAN bus controller modules are respectively connected to the two CAN bus via a driver shifting control unit; the initializing module is connected to the bus control initializing register for initializing the e CAN bus controller modules; a protocol processing module is connected to the FIFO buffer; the FIFO buffer is connected to the node processor via the logical interface; a intermitting process unit sends the corresponding intermitting control signal to the CAN bus transceiving modules according to the CAN bus controller modules; one path of the CAN bus controller module is directly connected to the protocol processing module; another path is connected to the protocol processing module via the bus receiving buffer.

本发明提供了一种双冗余CAN总线控制器，设置于双线CAN总线上，其特征在于：两个CAN总线收发模块、两个初始化模块分别与CAN总线控制器模块A和CAN总线控制器模块B相对应；两个CAN总线控制器模块通过驱动器切换控制单元分别与两条CAN总线相连；初始化模块与总线控制器初始化寄存器相连，对所对应的CAN总线控制器模块进行初始化；协议处理模块与FIFO缓存器相连；FIFO缓存器通过逻辑接口与节点处理器连接；中断处理单元根据CAN总线控制器模块的控制命令对CAN总线收发模块发出相应的中断控制信号；CAN总线收发模块一路与协议处理模块直接相连，另一路通过总线接收缓存器与协议处理模块相连。

"The operators will suffer a temporary decrease in the number of consumers and short message services as people may not like having to provide their ID cards for a phone number," Xu Junqi, vice-dean with the Policy-Making Institute of the Telecommunications Research Centre under MII, said yesterday.

信息产业部下属的通信决策研究院副主任徐俊其昨天说：&实行手机实名制后，人们可能不太情愿用身份证注册手机号，所以通信运营商会暂时面临用户减少和短信用户减少的问题。&

I don't believe in make-believe!

我不相信这些虚构的故事。