Table 1 For each possible component P in an adjacency graph we give the number of vertices, the DCJ distance (that can be obtained in [4]) and the maximum values for Λ(P), λ(P) and σ(P).
|P| | dDCJ(P) | max Λ(P) | max λ(P) | max σ(P) |
|---|---|---|---|---|
1 | 0 | 1 | 1 | 1 |
2 | 0 | 2 | 2 | 1 |
3 | 1 | 3 | 2 | 1 |
4 | 1 | 4 | 3 | 2 |
5 | 2 | 5 | 3 | 2 |
6 | 2 | 6 | 4 | 2 |
7 ⋮ |P| | 3 ⋮ ⌊(|P| – 1)/2⌋ | 7 ⋮ |P| | 4 ⋮ ⌈(|P| + 1)/2⌉ | 2 ⋮ ⌈(|P| + 1)/4⌉ |