id:A006714 - OEIS Search Results

Search: id:A006714

Displaying 1-1 of 1 results found.

page 1

Number of trivalent bipartite labeled graphs with 2n nodes.
(Formerly M4757)

+0
1

10, 840, 257040, 137260200, 118257539400, 154678050727200 (list; graph; listen)

	OFFSET	`3,1`
	REFERENCES	`R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.`
	CROSSREFS	`Adjacent sequences: A006711 A006712 A006713 this_sequence A006715 A006716 A006717` `Sequence in context: A013434 A013436 A013437 this_sequence A015033 A126677 A054328`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.