We shall deduce the result from a lemma about euler trails in directed multigraphs . 我们用一个关于有向重图中尤拉迹的引理来证明这个定理。
In a multigraph both multiple edges and multiple loops are allowed; a loop is a special edge . 在重图中允许有重边和重自环,自环是一种特殊的边。
If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph . 如果边都是顶点的有序对,则得到有向图和有向重图的概念。
Let xkv be the complete multigraph with v vertices , where any two distinct vertices x and y are joined by a edges ( z , y ) 设k _ v是有v个顶点的完全多重图,其中任意两个相异顶点x和y都由条边( x , y )相连。
With the modules and tools provided by suif2 , we implemented an algorithm to construct call multigraph , and verified results 利用suif2环境提供的模块和工具,我们实现了一个调用图的构造算法,并对算法做了验证。
In mathematics, a multigraph or pseudograph is a graph which is permitted to have multiple edges, (also called "parallel edges"For example, see Balakrishnan, p. 1.