交大111 線性代數與離散數學第3題｜離散數學 Ch6 圖論

離散數學›Ch6 圖論

第 13 題／共 34 題

13. 尤拉路徑、圖論、度數

#LS-06-013易尤拉路徑圖論度數

(5 points) Given a graph $G2$ that contains 7 vertices. The degree of two vertices in $G2$ is 3. The degree of the remaining vertices is 2. Please show if the $G2$ contains an Euler path. Construct the $G2$ if $G2$ exists an Euler path.

📄 交大111

▤完整推導請見《WH 資工筆記 · 離散數學》Ch6 圖論

本章題號 · 1–20 / 34