Search Results for ""

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 pseudoanalytic function is a function defined using generalized Cauchy-Riemann equations. Pseudoanalytic functions come as close as possible to having complex derivatives ...

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 hypergeometric class of orthogonal polynomials defined by R_n(lambda(x);alpha,beta,gamma,delta) =_4F_3(-n,n+alpha+beta+1,-x,x+gamma+delta+1; alpha+1,beta+delta+1,gamma+1;1) ...

A Reeb component is a Reeb foliation (M,F) whose leaves are proper. A foliation which has no Reeb components is said to be Reebless.

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A transformation in which all points along a given line L remain fixed while other points are shifted parallel to L by a distance proportional to their perpendicular distance ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...