construct graph polynomial
undirected unweighted graph
name or list(algebraic)
GraphPolynomial(G,x) returns a polynomial in the variables x1,...,xn when x is a symbol and G is a graph with n vertices. The polynomial consists only of linear factors of the form xj−xk where j and k represent adjacent vertices.
If x is a list of algebraic expressions whose length is equal to the number of vertices of G, the polynomial is formed using linear factors of the form xj−xk where j and k represent adjacent vertices.
Noga Alon and Michael Tarsi, "A note on graph colorings and graph polynomials", J. Combin. Theory Ser. B 70 (1997), no. 1, 197–201, doi: 10.1006/jctb.1997.1753
The GraphTheory[GraphPolynomial] command was updated in Maple 2019.
Download Help Document
What kind of issue would you like to report? (Optional)