In mathematics, a Tutte–Grothendieck (TG) invariant is a type of graph invariant that satisfies a generalized deletion–contraction formula. Any evaluation of the Tutte polynomial would be an example of a TG invariant.[1]
A graph function f is TG-invariant if:[2]
f(G)=\begin{cases} c|V(G)|&ifGhasnoedges\\ xf(G/e)&ifeisabridge\\ yf(G\backslashe)&ifeisaloop\\ af(G/e)+bf(G\backslashe)&else \end{cases}
Above G / e denotes edge contraction whereas G \ e denotes deletion. The numbers c, x, y, a, b are parameters.
The matroid function f is TG if:
\begin{align} &f(M1 ⊕ M2)=f(M1)f(M2)\\ &f(M)=af(M/e)+bf(M\backslashe) ifeisnotcolooporbridge \end{align}
It can be shown that f is given by:
f(M)=a|E|br(E)T(M;x/a,y/b)
where E is the edge set of M; r is the rank function; and
T(M;x,y)=\sumA(x-1)r(E)-r(A)(y-1)|A|-r(A)
is the generalization of the Tutte polynomial to matroids.
The invariant is named after Alexander Grothendieck because of a similar construction of the Grothendieck group used in the Riemann–Roch theorem. For more details see: