vertex condition 中文意思是什麼

vertex condition 解釋
頂點條件
  • vertex : n. （pl. vertexs, -tices ）1. 頂（點），絕頂。2. 【解剖學】顱頂，頭頂；【天文學】天頂；【幾】頂（點）。
  • condition : n 1 狀態，狀況，情形；品質。2 〈pl 〉外界狀況，周圍情形。3 地位，身分。4 條件；【語法】條件子句。...
  1. 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 ）圖的一種充分條件。
  2. Chapter 2 focuses on the discussion of vertex - neighbor - integrity of compound graphs. we give several upper and lower bounds of the vertex - neighbor - integrity of compound graphs in general condition. meanwhile, the vertex - neighbor - integrity of some special compound graphs such as path, cycle etc. are given

    第二章集中討論復合圖的鄰域完整度，給出了一般情形下復合圖鄰域完整度的上下界，路狀，圈狀等特殊復合圖的鄰域完整度，還糾正了pinardundar的幾個錯誤。
分享友人
分享到 Line

分享到臉書