連通度 的英文怎麼說
中文拼音 [liántōngdù]
連通度
英文
connectivity-
In the third section, we get the extremal graph of weighted graph whose connectivity is 2
在第三節中得到連通度為2的賦權圖在ore型條件下的極圖The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p
根據menger定理， n -維交叉立方體可以容納n - 1個故障頂點，我們給出了它的時間復雜度為o （ n ）的容錯路由選擇演算法及其最長路徑長度分析；在此基礎上本文證明， n -維交叉立方體的條件連通度為2n - 2 （ n 2 ） ，並給出了相應時間復雜度為o （ n ）的演算法及其最長路徑長度；除此之外，本文還證明當n -維交叉立方體中的故障簇個數不大於n - 1 ，其直徑不大於1 ，故障頂點總數不超過2n - 3 （ n 2 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。On restricted edge - connectivity of vertex - transitive graphs
點可遷圖的限制邊連通度Restricted edge connectivity of binary undirected kautz graphs
圖的限制性邊連通度Particularly, explicit expression for connectivity of cayley digraphs is given, doom and meng ' s results are also generalized and improved. at last, cayley digraphs with optimal connectivity are analyzed
特別地，給出了cayley圖連通度的精確表達式，推廣並改進了doorn和孟吉祥的結果，並在最後分析了一些達到最優連通度的cayely圖類。Goals of highway network planning, in terms of the total length of the highway network as well as the share of expressway and over class ii highways in the network, were analyzed in chapter two by using of network connection index and analogy methodology. the developing goals of shaanxi arterial highway network were proposed. in the third chapter, the overall arrangements for highway network were studied through the importance index of nodes and links
通過與世界經濟發達國家的公路網密度和運輸結構、以及我國其它地區，特別是與陜西省相鄰省（區）的公路網發展水平相對比，根據我國經濟發展「三步走」的奮斗目標，採用連通度指標測算和類比的方法，按網連通度、公路網密度、人均公路網總里程和單位汽車保有量的公路網總里程指標分別進行測算，確定了陜西省的公路網發展目標?公路總里程、高速公路里程和二級以上公路佔有率的適當范圍。The classical measure of the reliability is the connectivity and the edge connectivity
衡量網路可靠性的經典參數為圖的連通度和邊連通度。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
在最後一章中，我們使用高階邊連通度的結果研究對稱圖中樹分解的一個問題，給出了森林數等於樹數的一個充分條件。Then, because the connectivity, super connectedness, restricted connectivity and restricted - connectivity of a graph are important parameters to measure fault - tolerance of an interconnection network, they are of very important significance in design and analysis of fault - tolerant interconnection network in reality
圖的連通度，超連通度，限制連通度以及限制邊連通度是用來測量互連網容錯性的重要參數。在實際容錯網路設計和分析中有重要意義。But the difficulty with these two parameters is that they do not take into account what remains after the graph is disconnected. in fact, on one hand, it is often found that two graphs with the same number of vertices ( edges ) and the same connectivity ( edge - connectivity ) ) may result in entirely different forms after a minimum disconnecting set of vertices ( edges ) is removed, one may be totally disconnected while the other may consist of a few very stable components, and thus be much easier to reconstruct
對于兩個具有相同點（邊）數，具有相同點連通度（邊連通度）的圖，從圖中分別去掉使圖不連通的點（邊）集后，所得圖的結構可能完全不同，這是因為點連通度、邊連通度和局部點、邊連通度等連通性參數僅反映了系統被破壞的難易程度，而對系統遭受破壞的程度並沒有明確的反映。For further study, many variations have been introduced, which are known as higher order connectedness, such as super - connectedness, hyper - connectedness, super - a, r - restricted edge connectivity, etc. this dissertation studies graphs, especially symmetric graphs, with higher order connectedness
為了進一步的研究，人們提出了各種各樣的高階連通性概念，如super -性， hyper -性，超邊連通性， r -限制性邊連通度等。本論文主要利用圖的高階連通性研究網路（特別是對稱網路）的可靠性。Most notably, the parameters called connectivity and line - connectivity have been frequently used. the connectivity of a graph g is the least number of vertices of g whose removal disconnects g similarly, the line - connectivity of g is the least number of g whose removal disconnects g the higher the connectivity ( edge - connectivity ) of g, the more stable it is considered to be
而這些研究工作主要是圍繞點連通度，邊連通度，局部點、邊連通度來做的，但隨著圖的連通性研究的不斷深入，人們越來越覺得僅用點連通度，邊連通度，局部點、邊連通度來描述圖的連通性存在很大的局限性。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 ）圖的一種充分條件。Distribution of the limits of algebraic connectivity of tree
樹的代數連通度的極限點的分佈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
重點討論了點可遷圖的連通性及連通度，提出了原子匹配、原子收縮圖、原子穩定子群等一些新的概念，在此基礎上進一步分析了點可遷圖的結構特徵，完善了現有的點可遷圖的連通性理論。For the next interconnection network, we proved the connectivity of the n - enhanced crossed cube is n + 1, and its conditional connectivity is 2n ( n > 3 ) provided that all the neighbors of each professor do not fail at the same time, which is better than the hypercube and the crossed cube, two related algorithms in o ( n ) time are also given ; more, we proved that the n - enhanced crossed cube can tolerate as many as n faulty clusters of diameter at most 1 with at most 2n - 1 faulty nodes in total ( n > 3 ), which is better than the hypercube and the crossed cube also
本文證明n -維加強交叉立方體的連通度為n + l ，條件連通度為zn （ n > 3 ） ，簇容錯特徵數為（ n ， l ， zn ） ， （ : 1 > 3 ） ，這些性質都比交叉立方體的更優越。更進一步，木文也給出了加強交叉立方體的基於連通度的，條件連通度的時間復雜度為o （ n ）的容錯路由選擇演算法及最長路徑長度。One new sufficient condition for hamilton graphs
圖與連通度的一個充分條件Analysis of an information system model of maximal connectivity with time delay constraint
一個帶時延限制的最大連通度信息系統模型研究With the background stated above, g. gunther introduced vertex - neighbor - connectivity in 1991
Gunther於1991年引入圖的鄰域連通度概念， sIn the second section of chapter three, we prove theorem 3. 7 and a good example is given to show that the bound of locally connectivity is sharp
7的證明並且給出例子，說明該定理中的局部連通度的條件是最好可能的在53 3中，我們提出一個猜想，該猜想是由定理3gi 『和定理3分享友人