A381722 - OEIS

%I #13 Mar 30 2025 09:52:16

%S 1,3,12,6,70,3,116,3,135,3,177,3

%N Number of minimum connected dominating sets in the n-triangular honeycomb queen graph.

%C a(n) = 3 for n even, n != 4.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConnectedDominatingSet.html">Connected Dominating Set</a>.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumDominatingSet.html">Minimum Dominating Set</a>.

%K nonn,more

%O 1,2

%A _Eric W. Weisstein_, Mar 05 2025

%E a(11)-a(12) from _Eric W. Weisstein_, Mar 30 2025