Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006824
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006824 Number of connected regular bipartite graphs of degree 4 with 2n nodes.
(Formerly M3493)
+0
4
1, 1, 4, 14, 129, 1980, 62611, 2806490 (list; graph; listen)
OFFSET

4,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

CRC Handbook of Combinatorial Designs, 1996, p. 648.

I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Probl\`{e}mes combinatoires et th\'{e}orie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.

H. Gropp, On tactical configurations, regular bipartite graphs and (v,k,even)-designs, Discr. Math., 155 (1996), 81-98.

LINKS

B. D. McKay and E. Rogoyski, Latin squares of order ten, Electron. J. Combinatorics, 2 (1995) #N3.

M. Meringer, Tables of Regular Graphs

CROSSREFS

Cf. A006823, A006825.

A column of triangle A008326.

Sequence in context: A065062 A137048 A137056 this_sequence A162077 A111266 A098851

Adjacent sequences: A006821 A006822 A006823 this_sequence A006825 A006826 A006827

KEYWORD

nonn,hard,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research