作者lovefo (lovefo)
看板Grad-ProbAsk
标题[理工] [离散]-97中山电机
时间Tue Mar 23 20:30:52 2010
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
1F：推 assassin88:这题要打不少..晚点有空再PO XDD 03/23 20:49
2F：→ lovefo:感谢楼上 03/23 20:59