login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085618 Number of self-complementary 2-graphs with n nodes. 1
1, 1, 4, 0, 19, 10 (list; graph; refs; listen; history; internal format)
OFFSET

4,3

REFERENCES

F. C. Bussemaker, R. A. Mathon and J. J. Seidel, Tables of two-graphs, T.H.-Report 79-WSK-05, Technological University Eindhoven, Dept. Mathematics, 1979; also pp. 71-112 of "Combinatorics and Graph Theory (Calcutta, 1980)", Lect. Notes Math. 885, 1981.

T. Sozanski, Enumeration of weak isomorphism classes of signed graphs, J. Graph Theory 4 (1980), no. 2, 127-144.

CROSSREFS

Cf. A006627, A002854.

Sequence in context: A156457 A058348 A184946 * A076021 A199933 A078630

Adjacent sequences:  A085615 A085616 A085617 * A085619 A085620 A085621

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 11 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 03:37 EST 2012. Contains 205570 sequences.