Let’s compute the metrics for the 8-node tree shown on the right:
- 1. Nodes and Edges:
- Number of nodes: \(n = 8\)
- Number of edges: \(m = n - 1 = 7\)
- 2. Degree of each node:
- \(k_A = 2, k_B = 3, k_C = 3, k_D = 1, k_E = 2, k_F = 1, k_G = 1, k_H = 1\)
- Sum of degrees: \(\sum k_i = 14\)
- Check: \(2(n-1) = 2(7) = 14 \quad \checkmark\)
- 3. Network Density:
- \(d(T) = \frac{2}{n} = \frac{2}{8} = 0.25 \quad (25\%)\)
- 4. Average Degree:
- \(\bar{k} = \frac{2n - 2}{n} = \frac{14}{8} = 1.75\)