離散數學›Ch6 圖論
第 27 題/共 34 題
◀ LS 27/34
27. Handshaking Lemma、Degree、Connectivity
#LS-06-027中Handshaking LemmaDegreeConnectivity

Consider a set S\mathbf{S} of nn nodes interconnecting to form a graph G\mathbf{G}. If two nodes "directly connect" to each other, there is an undirected edge between them. Let D(a)D(a) denote the degree of a node aa. Which of the following are correct statements?

📄 中央112
跳轉到第題
▤完整推導請見《WH 資工筆記 · 離散數學》Ch6 圖論
本章題號 · 21–34 / 34