推 assassin88:這題要打不少..晚點有空再PO XDD 03/23 20:49
→ lovefo:感謝樓上 03/23 20:59
Write a proof for the following statement:
Given an undirected tree graph,when we add an edge to the graph,the graph
then have a Hamiltonian cycle.Prove that that this tree graph is a chain graph.
(A chain graph G(V,E) has V={V1,V2,......,Vn},E={(V1,V2),(V2,V3),...,(Vn-1,Vn)}
請問這題要怎麼證??
完全沒有頭緒
拜託了
--
一切....
似乎不再那麼重要....
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 125.230.3.167