login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #16 Mar 26 2015 07:20:47

%S 1,1,1,3,11,54,539,7319,209471,10000304

%N Number of connected graphs on n vertices whose spectrum has n distinct eigenvalues.

%C The spectrum refers to the eigenvalues of the adjacency matrix.

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GraphSpectrum.html">Graph Spectrum</a>

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

%K nonn,more

%O 1,4

%A _Travis Hoppe_ and _Anna Petrone_, May 27 2014

%E Corrected, original description as the "real spectrum" was incorrect, by _Travis Hoppe_, Mar 23 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)