Search Results for ""

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...

A paracompact space is a T2-space such that every open cover has a locally finite open refinement. Paracompactness is a very common property that topological spaces satisfy. ...

In the plane, if a line intersects one side of a triangle and misses the three vertices, then it must intersect one of the other two sides. This is a special case of the ...

The polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...

The diameter of a polygon is the largest distance between any pair of vertices. In other words, it is the length of the longest polygon diagonal (e.g., straight line segment ...

A point at which three or more polyhedron edges of a polyhedron meet. The concept can also be generalized to a polytope.

A loose term for a true statement which may be a postulate, theorem, etc.

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

The biconjugate gradient method often displays rather irregular convergence behavior. Moreover, the implicit LU decomposition of the reduced tridiagonal system may not exist, ...

A generalized conformal mapping.