Graph Polynomials#

Provides algorithms supporting the computation of graph polynomials.

Graph polynomials are polynomial-valued graph invariants that encode a wide variety of structural information. Examples include the Tutte polynomial, chromatic polynomial, characteristic polynomial, and matching polynomial. An extensive treatment is provided in [1].


Y. Shi, M. Dehmer, X. Li, I. Gutman, “Graph Polynomials”


Returns the Tutte polynomial of G


Returns the chromatic polynomial of G