Search results
Results from the WOW.Com Content Network
Important graph polynomials include: The characteristic polynomial, based on the graph's adjacency matrix. The chromatic polynomial, a polynomial whose values at integer arguments give the number of colorings of the graph with that many colors. The dichromatic polynomial, a 2-variable generalization of the chromatic polynomial
The graph of any polynomial with degree 2 or greater f(x) = a 0 + a 1 x + a 2 x 2 + ⋯ + a n x n, where a n ≠ 0 and n ≥ 2. is a continuous non-linear curve.
The graph of any cubic function is similar to such a curve. The graph of a cubic function is a cubic curve, though many cubic curves are not graphs of functions. Although cubic functions depend on four parameters, their graph can have only very few shapes. In fact, the graph of a cubic function is always similar to the graph of a function of ...
The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a function of the number of colors and was originally defined by George David Birkhoff to study the four color problem .
Graph of a polynomial of degree 4, with 3 critical points and four real roots (crossings of the x axis) (and thus no complex roots). If one or the other of the local minima were above the x axis, or if the local maximum were below it, or if there were no local maximum and one minimum below the x axis, there would only be two real roots (and two complex roots).
Graph of a polynomial function of degree 4, with its 4 roots and 3 critical points. + + + + = where a ≠ 0. The quartic is the highest order polynomial equation that can be solved by radicals in the general case (i.e., one in which the coefficients can take any value).
The discriminant of a polynomial is a function of its coefficients that is zero if and only if the polynomial has a multiple root, or, if it is divisible by the square of a non-constant polynomial. In other words, the discriminant is nonzero if and only if the polynomial is square-free.
The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory . It is defined for every undirected graph G {\displaystyle G} and contains information about how the graph is connected.