| 1. | We shall deduce the result from a lemma about euler trails in directed multigraphs .
我们用一个关于有向重图中尤拉迹的引理来证明这个定理。 |
| 2. | In a multigraph both multiple edges and multiple loops are allowed; a loop is a special edge .
在重图中允许有重边和重自环，自环是一种特殊的边。 |
| 3. | If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph .
如果边都是顶点的有序对，则得到有向图和有向重图的概念。 |
| 4. | 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 )相连。 |
| 5. | With the modules and tools provided by suif2 , we implemented an algorithm to construct call multigraph , and verified results
利用suif2环境提供的模块和工具，我们实现了一个调用图的构造算法，并对算法做了验证。 |
| 6. | A complete multigraph of order v and index a , denotes by xk , is a graph with v vertices , where any two distinct vertices x and y are jointed by a edges ( x , y )
设k _ v是有v个顶点的完全多重图，其中任意两个相异顶点x和y都由条边( x ， y )相连。 |
| 7. | We will show several previous results of the span of simple graphs and multigraphs , and we also will present a new algorithm to compute spt of multigraphs , furthermore we will discuss the bound of the span of a special multigraph and the algorithm of spt ( kn )
本文将给出一些关于简单图和重图的已知结论，同时还将给出一种计算重图的sp _ t的新算法，并将讨论取特殊t集时重图的t -匝算法以及完全图k _ n的t -匝算法。 |
| 8. | We present some classical theories about interprocedural analysis and optimization , including call multigraph construction , inline substitution and procedure cloning , and interprocedural information ( side - effect summary sets , alias information and interprocedural constant )
然后，我们对过程间分析和优化的一些经典的理论，包括调用图的构造，内联替换和过程克隆，过程间信息（副作用摘要集合，别名和过程间常量）作了介绍。 |
| 9. | That is , if we want to assign frequencies to a pair of adjacent cities or radio stations , then the difference of those two frequencies used has to avoid the set t . the t - colorings of multigraphs is a more practical case of t - colorings of graphs where interference may occur on different level
频率分配问题的图论模型可以这样得到：令收发信机为图中的点，两点之间有边当且仅当这两个收发信机干扰。重图的t -染色是图的t -染色的一个较为实用的部分，这是因为在研究频率分配时，干扰可能会在不同的水平上发生。 |
| 10. | In the paper , the connectivity and diameters of sell - complementary 2 - multigraphs and sell - complementary digraphs are discussed , and if these graphs get disrupted the relations for the number ob edges and vertices between the two connected components are also studied in self - complementary permutation
摘要本文讨论了2 -重自补图和有向自补图的连通性以及2 -重自补图的直径，同时以自补置换作为工具研究了当2 -重自补图或有向自补图被分成两个连通分支后，这两个连通分支之间的边数与顶点数之间的关系。 |
