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”).

A245882
Number of distinct Laplacian polynomials among all connected graphs on n nodes.
0
1, 1, 2, 6, 21, 110, 793, 10251, 239307, 10985229
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