A308557 -id:A308557 - cp's OEIS frontend

A308556 Number of (not necessarily connected) ungraceful graphs on n nodes.

Original entry on oeis.org

0, 1, 2, 4, 12, 30, 85, 300

Offset: 1

Eric W. Weisstein, Jun 07 2019

Eric Weisstein's World of Mathematics, Graceful Graph

Cf. A000088, A308548, A308557 (connected ungraceful graphs).

a(n) = A000088(n) - A308548(n). - Pontus von Brömssen, Dec 29 2024

a(8) from Eric W. Weisstein, Aug 16 2019

A308549 Number of connected graceful graphs on n vertices.

Original entry on oeis.org

1, 1, 2, 6, 18, 106, 819, 10969

Offset: 1

Eric W. Weisstein, Jun 06 2019

			1 node: K_1
2 nodes: P_2
3 nodes: P_3, C_3
4 nodes: K_1,3 (claw), K_4-e, P_4, paw graph, C_4, K_4
5 nodes: K_2,3, K_1,1,3, K_1,1,1,2, P_5, S_5, W_5 (and 12 more)

Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Graceful Graph
Eric Weisstein's World of Mathematics, Vertex Count

Cf. A001349, A308548 (not necessarily connected), A308557.

a(n) = A001349(n) - A308557(n). - Pontus von Brömssen, Dec 29 2024

a(8) from Eric W. Weisstein, Aug 16 2019

cp's OEIS Frontend

A308556 Number of (not necessarily connected) ungraceful graphs on n nodes.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions