Search Results for ""

The 4-polyhex illustrated above.

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

A matching is a maximum matching iff it contains no augmenting path.

A Bergman kernel is a function of a complex variable with the "reproducing kernel" property defined for any domain in which there exist nonzero analytic functions of class ...

If g(theta) is a trigonometric polynomial of degree m satisfying the condition |g(theta)|<=1 where theta is arbitrary and real, then g^'(theta)<=m.

The general curve of a system which is linearly dependent on a certain number of given irreducible curves will not have a singular point which is not fixed for all the curves ...

A convergence test also called "de Morgan's and Bertrand's test." If the ratio of terms of a series {a_n}_(n=1)^infty can be written in the form ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.

Johnson solid J_(50).

A graph with graph edges of two possible "colors," usually identified as red and blue. For a bichromatic graph with R red graph edges and B blue graph edges, R+B>=2.