Search Results for ""

A hyperbola for which the asymptotes are perpendicular, also called an equilateral hyperbola or right hyperbola. This occurs when the semimajor and semiminor axes are equal. ...

The Robertson graph is the unique (4,5)-cage graph, illustrated above. It has 19 vertices and 38 edges. It has girth 5, diameter 3, chromatic number 3, and is a quartic ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...

If two similar figures lie in the plane but do not have parallel sides (i.e., they are similar but not homothetic), there exists a center of similitude, also called a ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

The phrase Tomita-Takesaki theory refers to a specific collection of results proven within the field of functional analysis regarding the theory of modular Hilbert algebras ...

A triangle center (sometimes simply called a center) is a point whose trilinear coordinates are defined in terms of the side lengths and angles of a triangle and for which a ...

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...