A245880 - OEIS

A245880

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

1, 1, 2, 6, 21, 111, 821, 10423, 236064, 10375796

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

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 [math.CO], 2014.

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, Discr. Appl. Math. 201 (2016) 172-181.

Eric Weisstein's World of Mathematics, Characteristic Polynomial

CROSSREFS

Cf. A082104 (simple graphs, including disconnected ones, with unique characteristic polynomials).

KEYWORD

nonn,hard,more

AUTHOR

EXTENSIONS

Terms corrected by Eric M. Schmidt, Mar 20 2015

STATUS

approved