A245882 Number of distinct Laplacian polynomials among all connected graphs on n nodes.

1, 1, 2, 6, 21, 110, 793, 10251, 239307, 10985229

Offset: 1

Author

Travis Hoppe and Anna Petrone, Aug 05 2014

Keywords

• nonn
• hard
• more

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