|
EXAMPLE
|
The a(0) = 1 through a(3) = 16 sorted degree sequences:
() (0) (0,0) (0,0,0)
(2) (0,2) (0,0,2)
(1,1) (0,1,1)
(1,3) (0,1,3)
(2,2) (0,2,2)
(3,3) (0,3,3)
(1,1,2)
(1,1,4)
(1,2,3)
(1,3,4)
(2,2,2)
(2,2,4)
(2,3,3)
(2,4,4)
(3,3,4)
(4,4,4)
For example, the loop-graphs
{{1,1},{2,2},{3,3},{1,2}}
{{1,1},{2,2},{3,3},{1,3}}
{{1,1},{2,2},{3,3},{2,3}}
{{1,1},{2,2},{1,3},{2,3}}
{{1,1},{3,3},{1,2},{2,3}}
{{2,2},{3,3},{1,2},{1,3}}
all have degrees y = (3,3,2), so y is counted under a(3).
|