cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A122423 Number of unigraphic degree sequences among all graphs (connected or otherwise) on n vertices.

Original entry on oeis.org

1, 2, 4, 11, 28, 72, 170, 407, 956, 2252
Offset: 1

Views

Author

Gordon F. Royle, Sep 03 2006

Keywords

Comments

A degree sequence is unigraphic if there is only one graph (up to isomorphism) with that degree sequence.

Links

Crossrefs

Cf. A365548 (number of unigraphic graphs on n nodes that are connected).
Cf. A309757 (number of connected graphs that have distinct degree sequences among all connected graphs).

A365548 Number of unigraphic graphs on n nodes that are connected.

Original entry on oeis.org

1, 1, 2, 6, 16, 42, 96, 234, 546, 1292
Offset: 1

Views

Author

Eric W. Weisstein, Sep 08 2023

Keywords

Comments

a(n) <= A309757(n) since this sequence excludes connected graphs that share a degree sequence with one or more disconnected graphs.

Links

Crossrefs

Cf. A122423 (not-necessarily connected unigraphs).
Cf. A309757 (connected graphs that have distinct degree sequences among all connected graphs).
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.