離散數學›Ch6 圖論第 16 題／共 34 題
16. 圖的計數、連通分量
#LS-06-016中圖的計數連通分量
- (10%) Consider all simple (loop-free), undirected graphs on a set of 5 distinct labeled vertices . Every edge connects two distinct vertices, and multiple edges are not allowed. Assume that no vertex is isolated (i.e., every vertex has degree at least 1). (a) How many such graphs have exactly one connected component (i.e., the graph is connected)? (b) How many such graphs have exactly two connected components?
📄 成大115
▤完整推導請見《WH 資工筆記 · 離散數學》Ch6 圖論