A321250 Number of maximal independent vertex sets in the n X n torus grid graph.

1, 2, 6, 42, 220, 3644, 62272, 1794762, 83280570, 6210321492

Offset

1,2

Links

Table of n, a(n) for n=1..10.

Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set.

Eric Weisstein's World of Mathematics, Torus Grid Graph.

Mathematica

Table[Length@FindIndependentVertexSet[GraphProduct[CycleGraph[n], CycleGraph[n], "Cartesian"], Infinity, All], {n, 3, 8}] (* Eric W. Weisstein, Jan 26 2024 *)

Prog

(Python)
from networkx import find_cliques, complement, cartesian_product, cycle_graph
def A321250(n): return sum(1 for c in find_cliques(complement(cartesian_product(cycle_graph(n), cycle_graph(n))))) # Chai Wah Wu, Jan 11 2024

Crossrefs

Cf. A027683.

Sequence in context: A098814 A272177 A346548 * A156437 A127071 A353994

Adjacent sequences: A321247 A321248 A321249 * A321251 A321252 A321253

Keyword

nonn,more

Author

Eric W. Weisstein, Nov 01 2018

Extensions

a(1), a(2), and a(10) from Andrew Howroyd, Nov 01 2018

Status

approved