vertex connectivity 中文意思是什麼

vertex connectivity 解釋
點連通度
  • vertex : n. （pl. vertexs, -tices ）1. 頂（點），絕頂。2. 【解剖學】顱頂，頭頂；【天文學】天頂；【幾】頂（點）。
  • connectivity : 對外連系
  1. On restricted edge - connectivity of vertex - transitive graphs

    點可遷圖的限制邊連通度
  2. The adjacent matrix graph presentation in matricon and vertex - overlapping connectivity determination are the essential tools in the next work on un - unique labeled graph mining

    Matricon演算法中利用關聯矩陣形式代表圖的方法和sfp演算法中利用頂點重疊判連通性的思想在下一步非唯一標號圖的分析中也是一個重要工具。
  3. 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 ）圖的一種充分條件。
  4. Connectivity is discussed particularly, and some new conceptions are proposed, such as atom matching, atom - contracted digraph and atom stabilizer subgroup, based on which the structure characteristic of vertex - transitive digraphs is analyzed further, and current connectivity theory on vertex - transitive digraphs is consummated

    重點討論了點可遷圖的連通性及連通度，提出了原子匹配、原子收縮圖、原子穩定子群等一些新的概念，在此基礎上進一步分析了點可遷圖的結構特徵，完善了現有的點可遷圖的連通性理論。
  5. Edge and vertex connectivity

    割邊割點
  6. With the background stated above, g. gunther introduced vertex - neighbor - connectivity in 1991

    Gunther於1991年引入圖的鄰域連通度概念， s
分享友人
分享到 Line

分享到臉書