連通圖 的英文怎麼說

中文拼音 [liántōngtú]
連通圖 英文
co ected graph
  • 連 : Ⅰ動詞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. An articulation point is a vertex of a connected graph which can be split to yield an unconnected graph.

    如果一個連通圖的一個頂點能被分割，從而使這圖成為一個不連通圖，則這個頂點稱為斷點。
  2. A tree is a connected graph with no cycles.

    一個樹是一個沒有圈的連通圖。
  3. Extensibility of fully cycle of 5 - vertex connected graphs

    點連通圖的完全圈可擴性
  4. G is a minimal connected graph.

    G是一個極小連通圖。
  5. Two new sufficient conditions for traceable and almost traceable graphs

    連通圖可跡及幾乎可跡的兩個新充分條件
  6. Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph

    摘要本文中引進了連通圖的森林圖，它是樹圖的推廣。
  7. ( 2 ) for any connected graph g if there is at more one cycle, than and by proofing conclusion 2, we obtain findings on unique smallest domination set

    （ 2 ）對于連通圖g來說，若圖g中最多有一個圖，那麼而在證明結論（ 2 ）時，本文得出了唯一最小控制集的一個充分條件
  8. 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為平面的坐標向量。
  9. Bounds of the spectral radius of connected graphs

    連通圖的譜半徑的界
  10. For a given finite connected graph f, a group h of automorphisms of f and a finite group a = z, du, kawk and xu ( see [ 6 ] ) get some new matrix - theoretical characterizations to classify all the connected regular coverings of f having a as its covering transformation group, on which each automorphism in h can be lifted

    設為有限連通圖， h為它的自同構群的一個子群， a為給定一個初等交換p -群。杜少飛， kawk和徐明曜用矩陣的方法將的正則連通覆蓋圖進行了分類，其中以a作其為覆蓋變換群，並且h可提升。
  11. Covering a connected graph with bonds of minimum total size

    連通圖的極小鍵覆蓋
  12. Structure of maximal critically 4 - connected graphs

    一類極大臨界4連通圖的結構
  13. A sufficient condition for s - hamilton - connected graphs

    連通圖的一個充分條件
  14. A sufficient condition of hamilton connected graph

    連通圖的一個充分條件
  15. A note on edge reconstructions of graphs

    連通圖中可收縮邊的存在定理
  16. In this article, a algorithm ccn ( calculate crossing number ) is put forward to study the crossing number. it is a very important development in graph planarity issue after planarity - determinant algorithm and embedding algorithm

    本文首次給出了較好的計算圖的交叉數演算法ccn （ calculatecrossingnumber ） ，這是繼圖平面性判定演算法，二連通圖的平面嵌入演算法之後在圖的平面性問題上的一個最重要的進展。
  17. 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個頂點。
  18. 2. a > regular ^ - connected graphs, generalized petersen graphs and permutation graphs are studied extensively in the design of networks

    研究了k -正則k -連通圖、廣義petersen圖和置換圖的寬直徑。
  19. Combination of this lemma and the hamilton - connectivity involving neighborhood intersection obtains and improves or generalizes a series of classical results involving hamilton - connectivity, at the same time, we construct some extremal graphs to show the improved results to be the best possible ones. as for hamiltonicity, we omit the similar discussion

    由於每一個偶階哈密爾頓連通圖是o -因子-臨界的，我們在最後一章中我們主要涉及哈密爾頓連通性，利用一個重要的引理，我們得到了一些新結果，並且改進了或推廣了一些經典結論。
  20. ( 2 ) in this paper, we study the generalized fc - diameter of / c - regular k - connected graphs

    7間研究tk正則k連通圖的廣義k直徑
分享友人
分享到 Line

分享到臉書