M - multigraph 中文 - EN166

multigraph n.【商標】輪轉印刷機。vt.,vi.〔m-〕用輪轉油...

multiheaded
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 -重自補圖或有向自補圖被分成兩個連通分支后，這兩個連通分支之間的邊數與頂點數之間的關系。
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 -染色的一個較為實用的部分，這是因為在研究頻率分配時，干擾可能會在不同的水平上發生。
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 ) 然后，我們對過程間分析和優化的一些經典的理論，包括調用圖的構造，內聯替換和過程克隆，過程間信息（副作用摘要集合，別名和過程間常量）作了介紹。
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 -匝算法。
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 )相連。
With the modules and tools provided by suif2 , we implemented an algorithm to construct call multigraph , and verified results 利用suif2環境提供的模塊和工具，我們實現了一個調用圖的構造算法，并對算法做了驗證。
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 )相連。
If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph . 如果邊都是頂點的有序對，則得到有向圖和有向重圖的概念。
In a multigraph both multiple edges and multiple loops are allowed; a loop is a special edge . 在重圖中允許有重邊和重自環，自環是一種特殊的邊。
We shall deduce the result from a lemma about euler trails in directed multigraphs . 我們用一個關于有向重圖中尤拉跡的引理來證明這個定理。