A378517 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A378517

Number of dominating nonunique simple graphs on n nodes.

1

0, 0, 0, 2, 13, 104, 876, 11680, 271063, 11977655

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

LINKS

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

Eric Weisstein's World of Mathematics, Domination Polynomial.

Eric Weisstein's World of Mathematics, Dominating Unique Graph.

Eric Weisstein's World of Mathematics, Simple Graph.

FORMULA

a(n) = A000088(n) - A378516(n).

CROSSREFS

Cf. A378516 (number of dominating unique graphs).

Cf. A000088 (number of simple graphs).

Sequence in context: A259146 A103513 A067024 * A371583 A083062 A204261

Adjacent sequences: A378514 A378515 A378516 * A378518 A378519 A378520

KEYWORD

nonn,more,new

AUTHOR

Eric W. Weisstein, Nov 29 2024

STATUS

approved