login
A373393
Number of minimum connected dominating sets in the n-triangular grid graph.
1
1, 3, 3, 11, 32, 48, 16
OFFSET
0,2
COMMENTS
For n > 0, there are 2*(n-1) minimum connected dominating sets in the n-triangular grid graph.
LINKS
Eric Weisstein's World of Mathematics, Connected Dominating Set.
Eric Weisstein's World of Mathematics, Triangular Grid Graph.
CROSSREFS
Sequence in context: A322701 A124265 A163938 * A109937 A054101 A376024
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Jun 03 2024
STATUS
approved