A321618 -id:A321618 - cp's OEIS frontend

A303143 Number of minimum total dominating sets in the n-transposition graph.

0, 1, 9, 784, 3686400

Offset: 1

Eric W. Weisstein, Apr 19 2018

a(n) matches all 4 terms of the finite sequence A168257(n).
a(n) matches A060545(n-1)^2 for n=2 to 4.
All terms are squares (see comment in A303146). - Andrew Howroyd, Jun 11 2025

Eric Weisstein's World of Mathematics, Minimum Total Dominating Set.
Eric Weisstein's World of Mathematics, Transposition Graph.

Cf. A303146, A303150 (set size), A321618.

a(5) from Christian Sievers, Jun 25 2025

A303146 Number of total dominating sets in the n-transposition graph.

Original entry on oeis.org

0, 1, 49, 12680721

Offset: 1

Eric W. Weisstein, Apr 19 2018

First few terms are squares.

All terms are squares since the graph is bipartite and the two parts are isomorphic. In a bipartite graph each part is independently dominated by the other part. - Andrew Howroyd, Jun 11 2025

Eric Weisstein's World of Mathematics, Total Dominating Set
Eric Weisstein's World of Mathematics, Transposition Graph

Cf. A303143, A303150, A321618.

cp's OEIS Frontend

A303143 Number of minimum total dominating sets in the n-transposition graph.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions