Search Results for ""
81 - 90 of 729 for completeSearch Results
![](/common/images/search/spacer.gif)
A surface S is n-embeddable if it can be placed in R^n-space without self-intersections, but cannot be similarly placed in any R^k for k<n. A surface so embedded is said to ...
A strophoid of a circle with the pole O at the center of the circle and the fixed point P on the circumference of the circle. Freeth (1878, pp. 130 and 228) described this ...
Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...
Let M be a Riemannian manifold, and let the topological metric on M be defined by letting the distance between two points be the infimum of the lengths of curves joining the ...
Let E(k) and K(k) be complete elliptic integrals of the first and second kinds, with E^'(k) and K^'(k) the complementary integrals. Then ...
Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers k and l there exists an integer R(k,l) (known as the Ramsey number) ...
The residue classes of a function f(x) mod n are all possible values of the residue f(x) (mod n). For example, the residue classes of x^2 (mod 6) are {0,1,3,4}, since 0^2=0 ...
A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph G together with any edges whose endpoints are both in this ...
The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...
The Kirchhoff sum index KfS is a graph index defined for a graph on n nodes by KfS=1/2sum_(i=1)^nsum_(j=1)^n((Omega)_(ij))/((d)_(ij)), where (Omega)_(ij) is the resistance ...
![](/common/images/search/spacer.gif)
...