- 更多网络例句与有向图相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Li and one of his lemmas toabbreviate the nonnormal Cayley digraph 〓 into the case when 〓 is a dicycle.When 〓 is a dicycle,we give the sufficient and necessary conditions for 〓 to benonnormal and the structure of the corresponding automorphism group Aut.
Li定义的一个图〓，其中N是Aut的一个非平凡极小正规子群，和他的一个引理，把对非正规Cayley有向图Γ的讨论简化到〓是一个有向圈的情况，进而决定了当〓为有向圈时，Γ非正规的充要条件和Aut的结构。
-
Let G be a finite group, and S a subset of G not containing theidentity element 1. The Cayley digraph Cay on G with respect to S is definedas a directed graph with vertex set G and edge set {|g∈G, s∈S}. IfS~(-1)=S, then Cay is undirected and in this case, we view two directededges and as an undirected edge {u, v}. Obviously, the right regularrepresentation R of G, the acting group of G by right multiplication, is asubgroup of the full automorphism group AutCay(G, S of Cay.
给定有限群G，设S是G的不含单位元1的子集，群G关于子集S的Cayley有向图Cay是一个以G顶点集合，而以｛|g∈G，s∈S｝为边集合的有向图，特别地，若S~(-1)=S，则X=Cay是无向的，此时我们把一条无向边｛u，v｝等同于两条有向边和，易见，群G的右正则表示R，即G在G上的右乘作用，为图Cay的全自同构群AutCay
-
In an LS3PR net, it is verified that there exists a bijective mapping froma strongly connected block of its resource digraph into a strict minimal siphon. In anS3PR net, it is verified that there exists a bijective mapping from a strongly connectedcontributing subdigraph of its contributing resource digraph into a strict minimal siphonin it.
结合Petri网理论和图论，分别给出了LS3PR和S3PR网的资源有向图的概念，分别证明了在资源有向图和有效资源有向图中的强连通块对应LS3PR和S3PR网中的一个严格极小信标的结论。
-
Simulation results demostrate that the circuit simulation algorithmperforms better and it is applicable to more kinds of graphs,such as undirected graphs,directed graphs,and mixed graphs.6 At the end of the article,the applications of the algorithm in several fields aredescribed and the value of the method is pointed out.
测试表明，本算法在对几类常见图的同构判定中表现优于Nauty算法，而且可以适用于无向图、有向图及混合图等多种类型的图。6最后给出了电路模拟法在应用领域的成功应用实例，指出了电路模拟法的应用价值。
-
The flowchart program is stored in the memory with directed graph, a structure of the data.
框图程序则是以有向图这种数据结构表示存储在内存中的，之后再按照一些转换规则将其转换为也用有向图这一数据结构表示的有向图程序，这个转换的正确性也是前面证明过的。
-
In this dissertation, the ideas of simulating directed Hamilton path problems by sticker systems are designed using their massive parallelism; Then some properties of directed graphs and sufficiency and necessity conditions of existing Hamilton paths in graphs are presented based on the analysis to directed Hamilton path problems according to the properties of languages generated by the sticker systems.
本文利用粘贴系统的巨大并行性，首先设计了模拟有向哈密顿路问题的粘贴系统，然后通过此粘贴系统所产生语言的性质对有向哈密顿路问题进行分析，给出了有向图的若干结构性质以及图中存在有向哈密顿路的充要条件。
-
Layout segmentationand block recognition is combined in this algorithm which improves the processingefficiency.4 determination of logical order in layout based on directed graph.Space structure directed graph is set up from analysis the space structure of layoutobjects. This transfers the determination of logical order of layout objects into traversingsearch in directed graphs, from which the logical order of layout object is determined.
可以看出，该算法将版面分割与区域识别相结合，提高了算法的效率。4、基于有向图的版面对象顺序确定该算法利用版面对象的空间结构建立空间结构有向图，将版面对象之间的顺序确定，转换为在有向图空间进行遍历搜索的过程，通过图的遍历生成遍历树来确定版面对象顺序。
-
By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.
利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。
-
A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of two mutually opposite arcs.
用一条弧或一对方向相反的弧代替完全多部无向图的每一条边所得到的有向图被称为是半完全多部有向图。2002年L。
-
In this dissertation, we discuss mainly the existence problem of large sets of Hamiltoncycle and path decompositions.
本文主要研究完全图、完全二部图、完全对称有向图及完全对称有向二部图上的无向Hamilton圈和Hamilton路分解的大集问题以及几乎Hamilton圈和几乎Hamilton路分解的大集问题。
- 更多网络解释与有向图相关的网络解释 [注：此内容来源于网络，仅供参考]
-
digraph：有向图
对于一个图G,若边集E(G)为有向边的集合,则称此图为有向图(digraph),若边集E(G)为无向边的集合,则称此图为无向图(undigraph). 下图a和b分别为一个无向图G 1 和有向图G 2 ,图中每个顶点里的数字或字母为该顶点的符号、编号或关键字,每个图对应的顶点网络的例子(二)图的基本术语
-
signed digraph：信号有向图,符号有向图
signed digit number system 带符号数制 | signed digraph 信号有向图,符号有向图 | signed exponent 带符号指数
-
converse digraph：逆有向图
逆 converse | 逆有向图 converse digraph | 逆图 converse graph
-
directed circuit：有向图
克隆:site-directed mutagenesis | 有向图:directed circuit. | 有向图:Directed graph.
-
directed graph circuit algorithm：有向图电路算法
有向图 directed graph | 有向图电路算法 directed graph circuit algorithm | 有向逻辑关系 directed logical relation
-
digraph, directed graph：有向图
有向树|directed tree | 有向图|digraph, directed graph | 有效点|efficient point
-
Signed Directed Graph：符号有向图
符号定向图:signed directed graph | 符号有向图:Signed Directed Graph | 广义有向图:Generalized directed graph
-
Regular Directed Graph：正则有向图
图有向递归集:directed graph recursive set | 正则有向图:Regular Directed Graph | 无圈有向图:directed graph without a ring
-
directed graph undirected graph：有向图 无向图
Difference Manchester 差分曼彻斯特 | directed graph undirected graph 有向图 无向图 | distinguish 辩认区别
-
KKdirected graph undirected graph：有向图 无向图
KKDifference Manchester 差分曼彻斯特 | KKdirected graph undirected graph 有向图 无向图 | KKdistinguish 辩认区别