離散數學›Ch6 圖論第 27 題/共 34 題
27. Handshaking Lemma、Degree、Connectivity
#LS-06-027中Handshaking LemmaDegreeConnectivity
Consider a set of nodes interconnecting to form a graph . If two nodes "directly connect" to each other, there is an undirected edge between them. Let denote the degree of a node . Which of the following are correct statements?
📄 中央112
▤完整推導請見《WH 資工筆記 · 離散數學》Ch6 圖論