[圖論] connected graph
1. G is a connected graph iff it consists of one single connected component
這題除了寫trivial 還有甚麼證法呢?
=====================
2. connected graph with |V|>1 contains either a vertex of degree 1 or a cycle
請問這題要怎麼證呢?
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.228.27.89
→
10/29 22:03, , 1F
10/29 22:03, 1F
→
10/29 22:04, , 2F
10/29 22:04, 2F
推
10/29 23:08, , 3F
10/29 23:08, 3F
→
10/29 23:15, , 4F
10/29 23:15, 4F
→
10/30 03:17, , 5F
10/30 03:17, 5F
→
10/30 03:19, , 6F
10/30 03:19, 6F
討論串 (同標題文章)
以下文章回應了本文：
完整討論串 (本文為第 1 之 2 篇)：