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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006608 Number of n-node graphs not determined by their spectrum.
(Formerly M1981)
1
0, 0, 0, 0, 2, 10, 110, 1722, 51039, 2560606, 215331676, 31067572481 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

REFERENCES

C. Godsil and B. D. McKay, Some computational results on the spectra of graphs, pp. 73-92 of Combinatorial Mathematics IV (Adelaide 1975), Lect. Notes Math., 560 (1976).

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

LINKS

Andries E. Brouwer, Numbers of characteristic polynomials and cospectral graphs for A

A. E. Brouwer and E. Spence, Cospectral graphs on 12 vertices, Electr. J. Combin. 16 (2009) N20. (p. 199).

E. Spence, Numbers of characteristic polynomials and cospectral graphs for A

Eric Weisstein's World of Mathematics, Determined by Spectrum

CROSSREFS

Cf. A178925 (simple graphs determined by spectrum).

Sequence in context: A003222 A003167 A062412 * A066205 A113147 A206154

Adjacent sequences:  A006605 A006606 A006607 * A006609 A006610 A006611

KEYWORD

nonn,hard,more

AUTHOR

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

EXTENSIONS

a(10) from Eric W. Weisstein (eric(AT)weisstein.com), Dec 30 2010

Two more terms from Ruperto Corso (rupertocorsoto(AT)gmail.com), Dec 18 2011

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 06:09 EST 2012. Contains 205570 sequences.