In mathematics, a graph polynomial is a graph invariant whose value is a polynomial. Invariants of this type are studied in algebraic graph theory.[1]
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 flow polynomial, a polynomial whose values at integer arguments give the number of nowhere-zero flows with integer flow amounts modulo the argument.
The (inverse of the) Ihara zeta function, defined as a product of binomial terms corresponding to certain closed walks in a graph.
The Martin polynomial, used by Pierre Martin to study Euler tours
The matching polynomials, several different polynomials defined as the generating function of the matchings of a graph.
The reliability polynomial, a polynomial that describes the probability of remaining connected after independent edge failures
The Tutte polynomial, a polynomial in two variables that can be defined (after a small change of variables) as the generating function of the numbers of connected components of induced subgraphs of the given graph, parameterized by the number of vertices in the subgraph.
^Cite error: The named reference sdlg was invoked but never defined (see the help page).
a graphpolynomial is a graph invariant whose value is a polynomial. Invariants of this type are studied in algebraic graph theory. Important graph polynomials...
The chromatic polynomial is a graphpolynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a...
graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...
3) A polynomial function in one real variable can be represented by a graph. The graph of the zero polynomial f(x) = 0 is the x-axis. The graph of a degree...
computer science: Can the graph isomorphism problem be solved in polynomial time? (more unsolved problems in computer science) The graph isomorphism problem...
The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graphpolynomial. It is a polynomial in two variables which plays...
knots in knot polynomials. Alexander polynomial Bracket polynomial HOMFLY polynomial Jones polynomial Kauffman polynomialGraphpolynomial, a similar class...
polynomial is a polynomial of degree two in one or more variables. A quadratic function is the polynomial function defined by a quadratic polynomial....
characteristic polynomial to zero. In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency...
is called an isomorphism class of graphs. The question of whether graph isomorphism can be determined in polynomial time is a major unsolved problem in...
clique and a random graph. Although quasi-polynomially solvable, it has been conjectured that the planted clique problem has no polynomial time solution; this...
all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time, despite...
The chromatic polynomial of a graph, for example, counts the number of its proper vertex colorings. For the Petersen graph, this polynomial is t ( t − 1...
path graph on 4 vertices both have the same chromatic polynomial, for example. Connected graphs Bipartite graphs Planar graphs Triangle-free graphs Perfect...
related areas, a linear function is a function whose graph is a straight line, that is, a polynomial function of degree zero or one. For distinguishing...
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)} and...
homomorphism between given graphs is prohibitive in general, but a lot is known about special cases that are solvable in polynomial time. Boundaries between...
In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version...
polynomial time when the input is chordal. The treewidth of an arbitrary graph may be characterized by the size of the cliques in the chordal graphs that...
mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors...
edge contractions. For every fixed graph H, it is possible to test whether H is a minor of an input graph G in polynomial time; together with the forbidden...
the tripartite graphs. Bipartite graphs may be recognized in polynomial time but, for any k > 2 it is NP-complete, given an uncolored graph, to test whether...
polynomial time on a classical or quantum computer? Can the graph isomorphism problem be solved in polynomial time? Is graph canonization polynomial time...
automorphisms is polynomial-time equivalent to graph isomorphism. The graph automorphism problem is the problem of testing whether a graph has a nontrivial...
If graph isomorphism is NP-complete, the polynomial time hierarchy collapses to its second level. Since it is widely believed that the polynomial hierarchy...
Global Information