|
|
A243048
|
|
Number of simple graphs on n nodes having a non-unique Tutte polynomial.
|
|
1
|
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Graphs on different numbers of nodes can have identical Tutte polynomials; the numbers here represent counts of non-unique polynomials among other n-node graphs only.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
On 4 nodes,
P_3 \cup K_1 and 2P_2 both have Tutte polynomial x^2
P_4 and K_1,3 both have Tutte polynomial x^3
so there are a(4) = 2 + 2 = 4 graphs with non-unique Tutte polynomials.
|
|
CROSSREFS
|
Cf. A243049 (number of Tutte-unique graphs).
Cf. A000088 (number of simple graphs on n nodes).
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|