Search Results for ""

If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

An oriented knot is an oriented link of one component, or equivalently, it is a knot which has been given an orientation. Given an oriented knot K, reversing the orientation ...

A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...

An oriented link is a link for which each connected component has been given an orientation. As oriented links are equivalent, if there is an orientation preserving ...

The orthic inconic of a triangle is the inconic with inconic parameters x:y:z=cosA:cosB:cosC. (1) It has trilinear equation ...

An orthodiagonal quadrangle is a quadrangle whose diagonals are perpendicular to each other. If a, b, c, and d are the sides of a quadrangle, then this quadrangle is ...

In elementary geometry, orthogonal is the same as perpendicular. Two lines or curves are orthogonal if they are perpendicular at their point of intersection. Two vectors v ...

The orthogonal complement of a subspace V of the vector space R^n is the set of vectors which are orthogonal to all elements of V. For example, the orthogonal complement of ...

The orthogonal decomposition of a vector y in R^n is the sum of a vector in a subspace W of R^n and a vector in the orthogonal complement W^_|_ to W. The orthogonal ...