A simple undirect graph x is said to vertex - transitive , edge - transitive , and arc - transitive , if its automorphism group acts transitively on the vertices , edges and arcs , respectively 如果一个简单的无向图的自同构群分别传递的作用在它的点集，边集和弧集上，那么分别称这个图是点传递的，边传递的和弧传递的。
Many results on undirected vertex - transitive graphs are applied on directed cases in parallel . and some different conclusions from undirected case are obtained . it is proved that the above two conjectures hold for vertex - digraphs 我们将许多无向点可迁图的结果平行地推广到有向点可迁图中，同时得到了一些不同与无向图情形的结论。
The method first find the vertex aggregate and the edge aggregate primary , then revise them after checking the radian of the palm - line between two vertices , the palm - lines ’ number between two vertices and the distance of the vertices 该算法先初步确定无向图的顶点集和边集,然后通过考查顶点之间掌纹线的弧度、顶点之间掌纹线的条数和顶点之间的距离对顶点集和边集进行了适当的修正。
Referring to the knowledge of palm diagnosis ; this dissertation mainly studies the method to these special structures ’ recognition in the automated palm diagnosis system . the research includes following parts : 1 . the denotation of the palm - line undirected graph 结合手掌诊病知识,本文主要针对自动手掌诊病系统中奇异纹的识别作了较深入的研究,主要研究内容包括: 1 .研究掌纹线无向图的表示算法。
The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard , and many practical problems can be formulated to it . therefore , studying the mcp is full of significance both in theory and in practice 最大团问题是一个经典的np难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。
In chapter 4 , the conception of binding number of undirected graphs is introduced to digraphs , based on which the relationship between degree condition of vertices and girth is generalized to the relationship between neighborhood condition of vertices sets and girth 由于若无向图g的结合数b ( g ) 3 / 2 ，则g中存在三角形，而caccetta - h ( ? ) ggkvist猜想研究有向图中存在有向三角形的条件，受此启发，我们在有点向图中引入结合数的概念。
Using these reductions , firstly some edges of the graph g can be deleted , secondly the resulting graph g1 can be changed to a directed graph g2 , thirdly the directed graph g2 can be redacted to a directed graph g3 , and finally the reliability of the grapn g can be obtained by appling a sdp algorithm or a factoring algorithm to the directed graph g3 利用这些原则可以删去无向图g中不相关的边，得到图g _ 1 ；图g _ 1经过一系列的转化，成为有向图g _ 2 ；对有向图g _ 2进一步化简得到有向图g _ 3 ；最后图g的可靠度就可以通过求有向图g _ 3的可靠度而得到。
Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically 首先,采用广度优先搜索算法查找电气原理图中的连通导线端点集,并根据不同类型的继电元件对应的cad图块结构的不同,得到电气原理图中元件接线端子之间的连接关系;其次,根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格,并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成;最后,提出了完全无向图中经过每个顶点一次且仅一次的优化路径算法,利用该算法和经过预处理的prim最小生成树算法自动生成屏内安装接线图和端子接线图。
Firstly , we study some models which are often used in reconstructing gene regulatory networks , weighed matrices model , boolean networks model , mutual - information networks model , linear combination model , directed graphs and undirected graphs , bayesian networks model and analyze the strengths and weakness of each model by discussing each model ’ s details 首先,我们探讨了用于推断基因表达调控网络的一些常用模型,加权矩阵模型、布尔网络模型、互信息关联网络模型、线性组合模型、有向图和无向图以及贝叶斯网络模型。逐个分析了每种方法的优缺点。
