A291573 Number of minimal dominating sets in the n-Fibonacci cube graph.

2, 2, 5, 14, 73, 1460, 138536

Offset

1,1

Comments

The size of the smallest set, the domination number, is given by A291295.

Links

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

Eric Weisstein's World of Mathematics, Fibonacci Cube Graph

Eric Weisstein's World of Mathematics, Minimal Dominating Set

Wikipedia, Fibonacci cube

Example

Case n=1: The vertices are 0, 1. Each singleton vertex set is a minimal dominating set, so a(1) = 2.
Case n=2: The vertices are 00, 01, 10. Minimal dominating sets are {00} and {01, 10}, so a(2) = 2.
Case n=3: The vertices are 000, 001, 010, 100, 101. Minimal dominating sets are {000, 001}, {000, 100}, {000, 101}, {010, 101}, {001, 010, 100}, so a(3)=5.

Crossrefs

Cf. A291295, A291742.

Sequence in context: A384109 A176856 A112709 * A208353 A208001 A200801

Adjacent sequences: A291570 A291571 A291572 * A291574 A291575 A291576

Keyword

nonn,more

Author

Andrew Howroyd, Aug 30 2017

Status

approved