login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A242952 Number of connected graphs on n vertices whose spectrum has n distinct eigenvalues. 1
1, 1, 1, 3, 11, 54, 539, 7319, 209471, 10000304 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

The spectrum refers to the eigenvalues of the adjacency matrix.

LINKS

Table of n, a(n) for n=1..10.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

Eric Weisstein's World of Mathematics, Graph Spectrum

CROSSREFS

Cf. A064731 (integral graphs), A242953 (non-distinct spectrum graphs).

Sequence in context: A267832 A095707 A259105 * A266027 A306177 A094259

Adjacent sequences:  A242949 A242950 A242951 * A242953 A242954 A242955

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, May 27 2014

EXTENSIONS

Corrected, original description as the "real spectrum" was incorrect, by Travis Hoppe, Mar 23 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 17:31 EST 2020. Contains 338807 sequences. (Running on oeis4.)