Search Results for ""
1741 - 1750 of 2999 for Integral graphSearch Results
The absolute value of a real number x is denoted |x| and defined as the "unsigned" portion of x, |x| = xsgn(x) (1) = {-x for x<=0; x for x>=0, (2) where sgn(x) is the sign ...
The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...
The Kampé de Fériet function is a special function that generalizes the generalized hypergeometric function to two variables and includes the Appell hypergeometric function ...
A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...
An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...
The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not ...
A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...
A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...
The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...
A planted plane tree (V,E,v,alpha) is defined as a vertex set V, edges set E, root v, and order relation alpha on V which satisfies 1. For x,y in V if rho(x)<rho(y), then ...
...
View search results from all Wolfram sites (58484 matches)

