Search Results for ""

A bivariate polynomial is a polynomial in two variables. Bivariate polynomials have the form f(x,y)=sum_(i,j)a_(i,j)x^iy^j. A homogeneous bivariate polynomial, also called a ...

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

If the abstract simplicial complex S is isomorphic with the vertex scheme of the simplicial complex K, then K is said to be a geometric realization of S, and is uniquely ...

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

A mathematical relationship transforming a function f(x) to the form f(x+a).

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...