離散數學›Ch6 圖論
第 11 題/共 34 題
◀ LS 11/34
11. 尤拉路徑、鄰接矩陣、加權圖
#LS-06-011易尤拉路徑鄰接矩陣加權圖
  1. (e) (2 points) Please answer TRUE or FALSE and give a CONCISE explanation: In the graph represented by the adjacency matrix

e1e2e3e4e5e6e7v11000001v20000111v31101010v40110000v50011100\begin{array}{c|ccccccc} & e_1 & e_2 & e_3 & e_4 & e_5 & e_6 & e_7 \\ \hline v_1 & 1 & 0 & 0 & 0 & 0 & 0 & 1 \\ v_2 & 0 & 0 & 0 & 0 & 1 & 1 & 1 \\ v_3 & 1 & 1 & 0 & 1 & 0 & 1 & 0 \\ v_4 & 0 & 1 & 1 & 0 & 0 & 0 & 0 \\ v_5 & 0 & 0 & 1 & 1 & 1 & 0 & 0 \end{array}

with ∣e1∣=1|e_1|=1, ∣e2∣=2|e_2|=2, ∣e3∣=1|e_3|=1, ∣e4∣=4|e_4|=4, ∣e5∣=1|e_5|=1, ∣e6∣=4|e_6|=4, ∣e7∣=5|e_7|=5, there exists an Euler path from v5v_5 to v1v_1.

📄 交大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 離散數學》Ch6 圖論
本章題號 · 1–20 / 34