A lower bound on the number of the distinct maximum genus embedding of the complete bipartite graph K(n,n).
A209201
A lower bound on the number of the distinct maximum genus embedding of the complete bipartite graph K(n,n).
Terms
- a(0) =1a(1) =0a(2) =16a(3) =0a(4) =7739670528a(5) =0a(7) =0a(9) =0
External references
- oeis: A209201