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!)
A245882 Number of distinct Laplacian polynomials among all connected graphs on n nodes. 0
1, 1, 2, 6, 21, 110, 793, 10251, 239307, 10985229 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix, L = A-D where A is the adjacency matrix and D the degree matrix.
LINKS
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, Laplacian Polynomial
CROSSREFS
Sequence in context: A130275 A363362 A156808 * A374617 A267653 A245880
KEYWORD
nonn,hard,more
AUTHOR
Travis Hoppe and Anna Petrone, Aug 05 2014
STATUS
approved

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 September 13 22:05 EDT 2024. Contains 375910 sequences. (Running on oeis4.)