connected graph 中文意思是什麼
connected graph
解釋
連接圖-
An articulation point is a vertex of a connected graph which can be split to yield an unconnected graph.
如果一個連通圖的一個頂點能被分割，從而使這圖成為一個不連通圖，則這個頂點稱為斷點。 -
If enough edges have been drawn to make the figure connected the graph is called bipartite.
如果有足夠的線使圖連通，這圖稱為雙圖。 -
A tree is a connected graph with no cycles.
一個樹是一個沒有圈的連通圖。 -
Theorem 5 let g is a 2 - connected nonhamilton weighted graph satisfying conditions d1 and d2
定理5設g是滿足條件di和dz的2一連通非hamiltort賦權圖 -
Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。 -
G is a minimal connected graph.
G是一個極小連通圖。 -
And give exact values of bw ( g ) for four types of graphs. a upper bound of bw ( g ) for every connected simple graph g. the main results are as follows : propsition 2. 2 if n > 6, then bw ( pn ) = 1
在圖弱控制的束縛數中，對樹t給出其b _ w （ t ）的上緊界；另對四類常見圖類g給出b _ w （ g ）的精確值。 -
A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.
一個構形是面圖的一連串連通的頂點與這些頂點的度。 -
Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph
摘要本文中引進了連通圖的森林圖，它是樹圖的推廣。 -
For simplicity we assume that the graph of the network is connected.
為了簡便起見，假設網路的圖是連通的。 -
Evidently, the graph must be connected in order to contain a spanning tree.
顯然一個圖必須是連通的才能包含一生成樹。 -
( 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 ）時，本文得出了唯一最小控制集的一個充分條件 -
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為平面的坐標向量。 -
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可提升。 -
Covering a connected graph with bonds of minimum total size
連通圖的極小鍵覆蓋 -
A sufficient condition of hamilton connected graph
連通圖的一個充分條件 -
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個頂點。 -
If for all v v ( g ), ( n ( v ) ) is k - connected, then we call g a locally k - connected graph
若對任意的。 evk ） ，以州是k隨的，則稱g是局部k連通的 -
Strongly connected graph
強連通圖 -
Weakly connected graph
弱連通圖
分享友人