|
EXAMPLE
|
T(8,3) = 6. Edge-lists for the 6 3-regular 8-node graphs:
Graph 1: 12, 13, 14, 23, 24, 34, 56, 57, 58, 67, 68, 78
Graph 2: 12, 13, 14, 24, 34, 26, 37, 56, 57, 58, 68, 78
Graph 3: 12, 13, 23, 14, 47, 25, 58, 36, 45, 67, 68, 78
Graph 4: 12, 13, 23, 14, 25, 36, 47, 48, 57, 58, 67, 68
Graph 5: 12, 13, 24, 34, 15, 26, 37, 48, 56, 57, 68, 78
Graph 6: 12, 23, 34, 45, 56, 67, 78, 18, 15, 26, 37, 48.
Triangle starts
1;
1, 1;
1, 0, 1;
1, 1, 1, 1;
1, 0, 1, 0, 1;
1, 1, 2, 2, 1, 1;
1, 0, 2, 0, 2, 0, 1;
1, 1, 3, 6, 6, 3, 1, 1;
1, 0, 4, 0, 16, 0, 4, 0, 1;
1, 1, 5, 21, 60, 60, 21, 5, 1, 1;
1, 0, 6, 0, 266, 0, 266, 0, 6, 0, 1;
1, 1, 9, 94, 1547, 7849, 7849, 1547, 94, 9, 1, 1;
...
|