[理工] [離散]-圖論
1.edge connectivity
2.vertex connectivity
3.minimal domain set
問一下這三個的意思?
--
◤ ◥ 答 ◤ ◥ 拉 ◤ ◥ 米 ◤ ◥ 哆
Σ ◆ ◆ 蚊 Σ ◆ ◆ 肥 Σ ◆ ◆ 開 Σ ◆ ◆ 啦
︵ 吸 ︵ 兒 ︵ 喇 ︵ 太
◣++++++◢ ◣++++++◢ ◣++++++◢ 雞 ◣++++++◢ 裸
◥▇▆@ ≡ @▆▇◤ Ψ ≡ Ψ ▄ ≡ ▄ 囉 ▄▄▄ ≡ ▄▄▄
▅ ▅ ▄/ ▅ \▄ ▅ ＡΓＶＩＳＳ
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.136.82.109
推
02/21 19:58, , 1F
02/21 19:58, 1F
→
02/21 19:58, , 2F
02/21 19:58, 2F
→
02/21 19:59, , 3F
02/21 19:59, 3F
The connectivity or vertex connectivity κ(G) is the size of a smallest
vertex cut. A graph is called k-connected or k-vertex-connected if its vertex
connectivity is k or greater.
拿掉k個點才使圖不連通 = 每個點的degree至少k (這樣有錯嗎?)
如果對的話，一個圖的vertex connectivity = edge connectivity ??
※ 編輯: polomoss 來自: 220.136.82.109 (02/21 20:16)
→
02/21 21:12, , 4F
02/21 21:12, 4F
→
02/21 22:08, , 5F
02/21 22:08, 5F
→
02/21 22:09, , 6F
02/21 22:09, 6F
推
02/22 00:08, , 7F
02/22 00:08, 7F
推
02/22 03:29, , 8F
02/22 03:29, 8F
→
02/22 03:30, , 9F
02/22 03:30, 9F
推
02/22 12:32, , 10F
02/22 12:32, 10F
→
02/22 12:33, , 11F
02/22 12:33, 11F
討論串 (同標題文章)