Discrete math (7th edition)
1. graph
1.1. graph model
Def:
Def: simple
Def: multi
Def: psedo
Def: directed
Note: overall
1.2. attributes
Def: connected
Def: neighbor
Def: degree
Theorem: degree & edges
Theorem: (undirected graph) odd degrees
Theorem: degree & edges
1.3. 同构
Def;
1.4. connection
1.4.1. path
Def: path
Theorem:
Def: 回路
1.4.2. undirected
Def:
Theorem:
Def:
Def:
Def:
Theorem:
1.4.3. directed
Def:
Def:
1.5. euler path
Def: Euler
Theorem:
Theorem:
Def: Hamilton
Theorem:
2. tree
2.1. tree model
Def: tree
Qua: necc & suff
- 2(n-1) degree & all degrees >=1 <=3
(n-1) in degrees & all degress <= 1
