邊連通圖 的英文怎麼說

中文拼音 [biānliántōngtú]
邊連通圖 英文
edge connected graph
  • 邊 : 邊Ⅰ名詞1 （幾何圖形上夾成角的直線或圍成多邊形的線段） side; section 2 （邊緣） edge; margin; oute...
  • 連 : Ⅰ動詞1 （連接） link; join; connect 2 （連累） involve （in trouble）; implicate 3 [方言] （縫） ...
  • 通 : 通量詞（用於動作）
  • 圖 : Ⅰ名詞1 （繪畫表現出的形象; 圖畫） picture; chart; drawing; map 2 （計劃） plan; scheme; attempt 3...
  • 連通 : feed through; connection; connected; intercommunication
  1. The connectivities of the adjacency leaf exchange forest graphs

    鄰接葉邊交換森林圖的連通性
  2. By two ways, this paper debates the theory of fracture detection : on one hand by the way of edge detection in image processing ; on the other hand by time series analysis. the detection by time series analysis is more antinoise than edge detection in image processing. edge detection theory in image processing mainly includes correlation data, fuzzy edge detection, entropy operator edge detection and gradient edge detection

    圖像處理中的邊緣檢測的方法主要包括相干數據體法、模糊邊緣檢測法、基於熵運算元的邊緣檢測法、梯度邊緣檢測法；其中模糊邊緣檢測法比較依賴于參數的選擇，其渡越點兩邊的像素區別明顯；熵運算元的檢測方法則是檢測的圖像邊緣比較光滑，連通性好；梯度檢測法可以使用不同的運算元核，演算法比較簡單；相干數據體對于總體的大的裂縫的分佈具有比較奸的反應。
  3. On restricted edge - connectivity of vertex - transitive graphs

    點可遷圖的限制邊連通度
  4. Restricted edge connectivity of binary undirected kautz graphs

    圖的限制性邊連通度
  5. The super restricted edge connectivity of kautz undirected graphs

    圖的超級限制邊連通性
  6. This paper studies the band percolation of the models of the triangle lattice and the hexagonal lattice. before we study the models of the triangle lattice and the hexagonal lattice, we will introduce period. let g = ( vc, ec ) be a connected graph, we write vg for the set of vertices of g and egfor the set of its edges, u e vc is a vertex, and v is the coordinate vector

    在介紹平面正三角形和正六邊形點格的邊滲流模型之前我們先引入周期的概念：設g = （ v _ g ， e _ g ）為連通圖其中v _ g ， e _ g分別為圖g的頂點集和邊集， u v _ g為的頂點， v為平面的坐標向量。
  7. The classical measure of the reliability is the connectivity and the edge connectivity

    衡量網路可靠性的經典參數為圖的連通度和邊連通度。
  8. 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

    在最後一章中，我們使用高階邊連通度的結果研究對稱圖中樹分解的一個問題，給出了森林數等於樹數的一個充分條件。
  9. 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

    圖的連通度，超連通度，限制連通度以及限制邊連通度是用來測量互連網容錯性的重要參數。在實際容錯網路設計和分析中有重要意義。
  10. 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

    對于兩個具有相同點（邊）數，具有相同點連通度（邊連通度）的圖，從圖中分別去掉使圖不連通的點（邊）集后，所得圖的結構可能完全不同，這是因為點連通度、邊連通度和局部點、邊連通度等連通性參數僅反映了系統被破壞的難易程度，而對系統遭受破壞的程度並沒有明確的反映。
  11. 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 -限制性邊連通度等。本論文主要利用圖的高階連通性研究網路（特別是對稱網路）的可靠性。
  12. 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

    而這些研究工作主要是圍繞點連通度，邊連通度，局部點、邊連通度來做的，但隨著圖的連通性研究的不斷深入，人們越來越覺得僅用點連通度，邊連通度，局部點、邊連通度來描述圖的連通性存在很大的局限性。
  13. 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 ）圖的一種充分條件。
  14. The successful application of higher order connectedness on tree decomposition leads us to seek further implementation of higher order connectedness to other branches of graph theory

    而成功地應用高階邊連通性證明樹分解中的問題，使我們進一步尋找高階連通性在其它圖論問題中的應用。
  15. A note on edge reconstructions of graphs

    連通圖中可收縮邊的存在定理
  16. A 3 - restricted edge cut is such an edge cut that separates a connected graph into a disconnected one with each component having order at least 3

    摘要3限制性邊割將連通圖分離成不連通圖，使其各連通分支含有至少3個頂點。
  17. We propose some new ideas for finding the graphs, which has minimal or maximal value of the topological index among all the graphs with n vertices and m edges

    對n個頂點m條邊的簡單連通圖，哪些圖具有最小或最大的拓撲指標值也做了深入的研究。
  18. Among all the graphs with n vertices or m edges and some special graphs, the graphs that have minimal or maximal value of the topological index are found

    對于給定頂點數或邊數的簡單連通圖以及在一些特殊圖類中，確定了哪些分子圖具有最小或最大的拓撲指標值。
  19. Given the number of vertices and the number of edges in a class of graphs, the problem of how to determine a graph that has the minimum integrity among the class is studied

    對于所有的頂點數和邊數都給定的連通圖類，如何確定該圖類中完整度最小的圖。
  20. Also, if the number of vertices and the integrity in a class of graphs are fixed, the problem of how to determine a graph that has the maximum number of edges among them is investigated

    同時研究了對于頂點數和完整度都給定的連通圖類，如何確定該圖類中邊數最多的圖的問題。
分享友人
分享到 Line

分享到臉書