edge transitive graph 中文意思是什麼

edge transitive graph 解釋
邊可遷圖
  • edge : n 1 刀口,(刀)刃;鋒;端;銳利。2 邊,棱,邊緣,邊界,界線,界限。3 優勢,優越條件。4 (聲調、...
  • transitive : adj. 傳遞的,可轉移的;【語法】及物的;【物理學】過渡的。n. 及物動詞 (opp. intransitive)。adv. -ly ,-ness n.
  • graph : n. 1. 【數學】曲線圖;坐標圖,圖表。2. 統計曲線。vt. 用圖表表示,把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. In the last chapter, we use the results of higher order edge connectivity to study the tree decomposition of transitive graphs, deriving a sufficient condition for a graph to have tree number equivalent to the arboricity

    在最後一章中,我們使用高階邊連通度的結果研究對稱圖中樹分解的一個問題,給出了森林數等於樹數的一個充分條件。
  2. In the first chapter, the background and some basic results are introduced. in the second chapter, we study higher order edge connectivity, and obtained ( a ) except for three graphs, all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs, all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs, in particular, necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given

    第二章中,我們研究高階邊連通度,得到了如下結果: ( a )除了三個特殊圖外,所有具有有限躍階的無限循環圖都是超邊連通的; ( b )除了三種特殊圖類外,所有邊傳遞圖都是最優- ~ ( 3 )圖; ( c )刻劃了點傳遞圖的最優- ~ ( 3 )性,特別是給出了cayley圖和極小cayley圖為最優- ~ ( 3 )圖的充分必要條件; ( d )給出了一個圖(不一定是對稱圖)是最優- ~ ( 3 )圖的一種充分條件。
  3. 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

    如果一個簡單的無向圖的自同構群分別傳遞的作用在它的點集,邊集和弧集上,那麼分別稱這個圖是點傳遞的,邊傳遞的和弧傳遞的。
  4. A simple undirected graph is said to be semisymmetric if it is regular and edge - transitive but not vertex - transitive. this thesis consists of two parts

    如果一個簡單的無向圖是正則的,邊傳遞但不是點傳遞的,那麼稱它是半對稱的。
  5. A regular and edge - transitive graph which is not vertex - transitive is said to be semisymmetric

    半對稱圖是指正則,邊傳遞,但點不傳遞的圖。
分享友人