推 mar3:看到第一句就箭頭出去了 可憐的奇璁~~ 05/31 00:30
噓 jimmychad:看不出來是兩題阿~~愛嗆我的順雞@@ 06/01 17:43
推 SUESHIN:老啾耶 06/01 19:52
→ SUESHIN:我知道了!!老啾叫奇璁 06/01 19:53
順雞他說他po這個版會害羞 神經病
Give a proof or a counterexample for each statement below.
a) Every graph with connectivity 4 is 2-connected.
b) Every 3-connected graph has connectivity 3.
c) Every k-connected graph is k-edge-connected.
d) Every k-edge-connected graph is k-connected.
Let G be a connected graph with at least three vertices. From G’ from G by
adding an edge with endpoints x, y whenever dG(x, y) = 2. Prove that G’ is
2-connected.
幫他po一下 叫他po一下在那龜龜毛毛
兩題圖論
--
◢███████████████████▌
▉▋▍ ◢██ ◢▊█ ▊██ ███ ▋▍▏
▉▋▍ ██ ███ ▊██ ▊██ ▋▍▏
▉▋▍ ███ █▊█ ██◤ ██◤ ▋▍▏
█████████████ψazraeldark◤
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.124.3.14