A006714 - OEIS

This site is supported by donations to The OEIS Foundation.

A006714

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

10, 840, 257040, 137260200, 118257539400, 154678050727200 (list; graph; refs; listen; history; internal format)

	OFFSET	`3,1`
	REFERENCES	`R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	CROSSREFS	`Sequence in context: A013434 A013436 A013437 * A203533 A015033 A126677` `Adjacent sequences: A006711 A006712 A006713 * A006715 A006716 A006717`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

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

Last modified February 13 14:19 EST 2012. Contains 205504 sequences.