[圖論] connected graph

[mqazz1 (無法顯示)]

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
→ suhorng     :第二題是什麼意思 ? 那樹呢 ?
→ suhorng     :喔沒事....不要理我
推 GaussQQ     :第一題還可以寫 Very Trivial
→ mqazz1      :要是第一題寫trivial 不知道老師會給幾分..
→ genghis     :第二題 用不是tree 就有cycle來說明
→ genghis     :後面應該可以改成 two vertex of degree 1...