Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #18 Feb 21 2024 14:36:25
%S 1,2,4,11,28,72,170,407,956,2252
%N Number of unigraphic degree sequences among all graphs (connected or otherwise) on n vertices.
%C A degree sequence is unigraphic if there is only one graph (up to isomorphism) with that degree sequence.
%H Michael Koren, <a href="https://doi.org/10.1016/S0095-8956(76)80006-8">Pairs of Sequences with a Unique Realization by Bipartite Graphs</a>, Journal of Combinatorial Theory B, 21, 224-234, 1976.
%H Michael Koren, <a href="https://doi.org/10.1016/S0095-8956(76)80007-X">Sequences with a Unique Realization by Simple Graphs</a>, Journal of Combinatorial Theory B, 21, 234-244, 1976.
%H Shuo-Yen R Li, <a href="https://doi.org/10.1016/0095-8956(75)90072-6">Graphic Sequences with Unique Realizations</a>, Journal of Combinatorial Theory B, 19, 42-68, 1975.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UnigraphicGraph.html">Unigraphic Graph</a>.
%Y Cf. A365548 (number of unigraphic graphs on n nodes that are connected).
%Y Cf. A309757 (number of connected graphs that have distinct degree sequences among all connected graphs).
%K nonn,more
%O 1,2
%A _Gordon F. Royle_, Sep 03 2006