A304565 Number of minimum total dominating sets in the n-triangular honeycomb obtuse knight graph.
0, 0, 0, 0, 108, 6, 12, 18, 2, 32, 4362, 1500
Offset: 1
Links
- Eric Weisstein's World of Mathematics, Minimum Total Dominating Set.
- Eric Weisstein's World of Mathematics, Triangular Honeycomb Obtuse Knight Graph.
Extensions
a(8)-a(11) from Andrew Howroyd, May 19 2018
a(12) from Eric W. Weisstein, Apr 04 2025