Search Results for ""

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...

The order-n bouquet graph B_n is a pseudograph consisting of a single vertex with n self-loops. The bouquet graph B_1 is a pseudograph that can be considered to correspond to ...

The diagonal triangle of a complete quadrangle is the triangle formed by its three diagonal points. If the quadrangle is a cyclic quadrilateral, then the circle is the polar ...

The dual of a regular tessellation is formed by taking the center of each polygon as a vertex and joining the centers of adjacent polygons. The triangular and hexagonal ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

Define A^' to be the point (other than the polygon vertex A) where the triangle median through A meets the circumcircle of ABC, and define B^' and C^' similarly. Then the ...

If G is a weighted tree with weights w_i>1 assigned to each vertex v_i, then G is perfectly weighted if the matrix M_G=[w_1 0 ... 0; 0 w_2 ... 0; | ... ... |; 0 0 ... ...

A term used in category theory to mean a general morphism. The term derives from the Greek omicronmuomicron (omo) "alike" and muomicronrhophiomegasigmaiotasigma (morphosis), ...

If all the eigenvalues of a real matrix A have real parts, then to an arbitrary negative definite quadratic form (x,Wx) with x=x(t) there corresponds a positive definite ...

In a space E equipped with a symmetric, differential k-form, or Hermitian form, the orthogonal sum is the direct sum of two subspaces V and W, which are mutually orthogonal. ...