[理工][離散] 99政大資科
1.
let Kn denote a complete simple graph with n>0 vertices.
then what is the length of a shortest circuit containing all
edages of graph K2n ?
去年有人討論 但...答案到底是?
證明:
Let G(V,E) be a directed multigraph such that E 不=空 and for all vertices
x 屬於V ,in-degree(x)=out-degree(x)
show that there exists a simple circuit of lengh>0 in G
該怎證? 我完全沒圖形想法
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 121.254.84.213
推
02/24 12:06, , 1F
02/24 12:06, 1F
→
02/24 12:09, , 2F
02/24 12:09, 2F
→
02/24 12:09, , 3F
02/24 12:09, 3F
→
02/24 12:10, , 4F
02/24 12:10, 4F