|
|
A245882
|
|
Number of distinct Laplacian polynomials among all connected graphs on n nodes.
|
|
0
|
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|