1 | initial version |
I've added another bit on:
sage: def c(k):
....: if k<3:
....: return 0
....: if k>2:
....: return sum_of_coeffs(nil(A,k))/(2*k)
where $c(k)$ returns the number of simple cycles in G of length $k$.
2 | improved style |
I've added another bit on:
sage:
def c(k): where $c(k)$ returns the number of simple cycles in G of length $k$.