Contact
CoCalc Logo Icon
StoreFeaturesDocsShareSupport News AboutSign UpSign In
| Download
Project: TMP
Views: 71
def parking(G): g = G.tutte_polynomial(); #return (-1)^G.size()*g(1,-1); return g(1,-1); import copy; def cone(G): coneG=copy.deepcopy(G); order=coneG.order(); for i in range(order): coneG.add_edges([(i,order)]); return coneG; for n in range(3,15): G=graphs.CycleGraph(n); G.allow_multiple_edges(True); print n, parking(cone(G)), fibonacci(n+1)+fibonacci(n-1)-2;
3 2 2 4 5 5 5 9 9 6 16 16 7 27 27 8 45 45 9 74 74 10 121 121 11 197 197 12 320 320 13 519 519 14 841 841