def parking(G):
g = G.tutte_polynomial();
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;