Search Results for ""

The number of inward directed graph edges from a given graph vertex in a directed graph.

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

Separation of variables is a method of solving ordinary and partial differential equations. For an ordinary differential equation (dy)/(dx)=g(x)f(y), (1) where f(y)is nonzero ...

A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The difference between the sum of face angles A_i at a polyhedron vertex of a polyhedron and 2pi, delta=2pi-sum_(i)A_i.

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

The set closure St^_v of a star Stv at a vertex v of a simplicial complex K.

A set X is called a "cone" with vertex at the origin if for any x in X and any scalar a>=0, ax in X.

Given a positive integer n, a labeled n-digraph is a digraph whose vertex set is {1,...,n}.