id:A122423 - OEIS Search Results

Search: id:A122423

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 2, 4, 11, 28, 72, 170, 407, 956, 2252 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`A degree sequence is unigraphic if there is only one graph (up to isomorphism) with that degree sequence.`
	REFERENCES	`Koren, M. Pairs of Sequences with a Unique Realization by Bipartite Graphs, Journal of Combinatorial Theory B, 21, 224-234, 1976.` `Koren, M. Sequences with a Unique Realization by Simple Graphs, Journal of Combinatorial Theory B, 21, 234-244, 1976.` `Li, Graphic Sequences with Unique Realizations, Journal of Combinatorial Theory B, 19, 42-68, 1975.`
	CROSSREFS	`Cf. A122423.` `Sequence in context: A099525 A024742 A024962 this_sequence A099016 A026122 A108629` `Adjacent sequences: A122420 A122421 A122422 this_sequence A122424 A122425 A122426`
	KEYWORD	`nonn`
	AUTHOR	`Gordon Royle (gordon(AT)csse.uwa.edu.au), Sep 03 2006`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.