兩題圖論

看板NUK-AM95作者chuo (v(￣︶￣)y)時間16年前 (2008/05/30 12:45)推噓1(2推 1噓 1→)

留言4則, 3人參與討論串1/1

順雞他說他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

推

mar3

05/31 00:30, , 1^F

05/31 00:30, 1^F

噓

jimmychad

06/01 17:43, , 2^F

06/01 17:43, 2^F

推

SUESHIN

06/01 19:52, , 3^F

06/01 19:52, 3^F