login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A084565
Number of connected switching classes of signed graphs with n nodes.
1
1, 1, 3, 12, 79, 1123, 42065, 4880753, 1674021742, 1612191702946, 4291399235883144, 31570649902282023158, 644451747846907273827686, 36675914469877423648734408329, 5846124500387959287169919356171145
OFFSET
1,3
COMMENTS
Also, number of unlabeled connected strength 2 Eulerian graphs with n nodes. - Vladeta Jovovic, Mar 14 2009
REFERENCES
Bussemaker, F. C.; Cameron, P. J.; Seidel, J. J.; and Tsaranov, S. V., Tables of signed graphs, Report-WSK 91-01, Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, 1991, 105 pp. MR: 92g:05001.
LINKS
F. C. Bussemaker, P. J. Cameron, J. J. Seidel, and S. V. Tsaranov, Tables of signed graphs, Report-WSK 91-01, Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, 1991, 105 pp. (MR: 92g:05001).
CROSSREFS
Sequence in context: A058107 A213139 A023879 * A323634 A373395 A275488
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 16 2003
EXTENSIONS
Edited by N. J. A. Sloane Apr 05 2009 at the suggestion of Vladeta Jovovic
STATUS
approved