A284704 -id:A284704 - cp's OEIS frontend

Table[Count[Subsets[Range[2^n]], ?(CountDistinct[Flatten[# /. Table[k -> AdjacencyList[HypercubeGraph[n], k], {k, 2^n}]]] == 2^n &)], {n, 1, 3}] (* _Eric W. Weisstein, Apr 17 2018 *)

a(n) = A284704(n-1)^2. - Andrew Howroyd, Apr 16 2018

a(5)-a(6) from Andrew Howroyd, Apr 16 2018

A291062 Number of maximal irredundant sets in the n-hypercube graph.

Original entry on oeis.org

1, 2, 6, 12, 322, 217792

Offset: 0

Eric W. Weisstein, Aug 17 2017

Eric Weisstein's World of Mathematics, Hypercube Graph
Eric Weisstein's World of Mathematics, Maximal Irredundant Set

Cf. A284704, A290406, A290512.

a(5) from Andrew Howroyd, Aug 19 2017

A291704 Number of connected dominating sets in the n-hypercube graph.

Original entry on oeis.org

1, 3, 9, 115, 28853, 1920678791

Offset: 0

Eric W. Weisstein, Aug 30 2017

Eric Weisstein's World of Mathematics, Connected Dominating Set
Eric Weisstein's World of Mathematics, Hypercube Graph

Cf. A284704, A290758.

a(5) from Andrew Howroyd, Sep 04 2017

cp's OEIS Frontend

A290406 Number of minimal dominating sets in the n-hypercube graph.

Views

Author

Keywords

Links

Crossrefs

Extensions

A290512 Number of irredundant sets in the n-hypercube graph.

Views

Author

Keywords

Links

Crossrefs

Extensions

A295372 Number of total dominating sets in the n-hypercube graph.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A291062 Number of maximal irredundant sets in the n-hypercube graph.

Views

Author

Keywords

Links

Crossrefs

Extensions

A291704 Number of connected dominating sets in the n-hypercube graph.

Views

Author

Keywords

Links

Crossrefs

Extensions