Search Results for ""

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

A theorem giving a criterion for an origami construction to be flat. Kawasaki's theorem states that a given crease pattern can be folded to a flat origami iff all the ...

There are a number of functions in mathematics commonly denoted with a Greek letter lambda. Examples of one-variable functions denoted lambda(n) with a lower case lambda ...

Let a, b, and c be the lengths of the legs of a triangle opposite angles A, B, and C. Then the law of cosines states a^2 = b^2+c^2-2bccosA (1) b^2 = a^2+c^2-2accosB (2) c^2 = ...

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

Miller's rules, originally devised to restrict the number of icosahedron stellations to avoid, for example, the occurrence of models that appear identical but have different ...

Minkowski space is a four-dimensional space possessing a Minkowski metric, i.e., a metric tensor having the form dtau^2=-(dx^0)^2+(dx^1)^2+(dx^2)^2+(dx^3)^2. Alternatively ...

A number of attractive polyhedron compounds consisting of three octahedra. The first (left figues) is the polyhedron dual of the cube 3-compound. These compounds will be ...