TOPICS
Search

Search Results for ""


8561 - 8570 of 13134 for Extremal graph theorySearch Results
Two triangles are similar if their triples of vertex angles are the same.
External (or positive) and internal (or negative) similarity points of two circles with centers C and C^' and radii r and r^' are the points E and I on the lines CC^' such ...
Two figures are homothetic if they are related by a dilation (a dilation is also known as a homothecy). This means that the connectors of corresponding points are concurrent ...
A curve is simple if it does not cross itself.
Interest which is paid only on the principal and not on the additional amount generated by previous interest payments. A formula for computing simple interest is ...
A simple pole of an analytic function f is a pole of order one. That is, (z-z_0)f(z) is an analytic function at the pole z=z_0. Alternatively, its principal part is c/(z-z_0) ...
A root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...
The set St^_v-Stv, where St^_v is a closed star and Stv is a star, is called the link of v in a simplicial complex K and is denoted Lkv (Munkres 1993, p. 11).
Let f:K^((0))->L^((0)) be a bijective correspondence such that the vertices v_0, ..., v_n of K span a simplex of K iff f(v_0), ..., f(v_n) span a simplex of L. Then the ...
Let K and L be simplicial complexes, and let f:K^((0))->L^((0)) be a map. Suppose that whenever the vertices v_0, ..., v_n of K span a simplex of K, the points f(v_0), ..., ...
1 ... 854|855|856|857|858|859|860 ... 1314 Previous Next

...