disconnected graph 中文意思是什麼
disconnected graph
解釋
不連接圖形- disconnected : adj. 1. 斷了聯絡的，分離的。2. 支離破碎的，無系統的，（演說等）亂七八糟的。adv. -ly 無聯絡地，斷斷續續地。
- graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
-
This happens if the graph is disconnected or has a cutvertex.
如果一個圖是不連通的或有割點，就發生這種情況。 -
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
對于兩個具有相同點（邊）數，具有相同點連通度（邊連通度）的圖，從圖中分別去掉使圖不連通的點（邊）集后，所得圖的結構可能完全不同，這是因為點連通度、邊連通度和局部點、邊連通度等連通性參數僅反映了系統被破壞的難易程度，而對系統遭受破壞的程度並沒有明確的反映。 -
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個頂點。
分享友人