Search Results for ""

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 ...

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

The group of functions from an object G to itself which preserve the structure of the object, denoted Aut(G). The automorphism group of a group preserves the multiplication ...

The Császár polyhedron is a polyhedron that is topologically equivalent to a torus which was discovered in the late 1940s by Ákos Császár (Gardner 1975). It has 7 polyhedron ...

The Danzer configuration is a 35_4 self-dual configuration of 35 lines and 35 points in which 4 points lie on each line and 4 lines pass through each point. The Levi graph of ...

An embedding is a representation of a topological object, manifold, graph, field, etc. in a certain space in such a way that its connectivity or algebraic properties are ...

In geometry, an endpoint is one of the two points at the boundary of a line segment. In analysis, an endpoint is one of the two points at the boundary of a closed interval or ...