Search Results for ""

Truncation is the removal of portions of solids falling outside a set of symmetrically placed planes. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...

The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...

A two-regular graph is a regular graph for which all local degrees are 2. A two-regular graph consists of one or more (disconnected) cycles. The numbers a_n of two-regular ...

The term two-sided ideal is used in noncommutative rings to denote a subset that is both a right ideal and a left ideal. In commutative rings, where right and left are ...

A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

Consider expressions built up from variables and constants using function symbols. If v_1, ..., v_n are variables and t_1, ..., t_n are expressions, then a set of mappings ...

A uniform-density polyhedral solid is unistable (also called monostable) if it is stable on exactly one face (Croft et al. 1991, p. 61). For example, the 19-faced polyhedron ...

Let A be a C^*-algebra having no unit. Then A^~=A direct sum C as a vector spaces together with 1. (a,lambda)+(b,mu)=(a+b,lambda+mu). 2. mu(a,lambda)=(mua,mulambda). 3. ...

The validity of a logical argument refers to whether or not the conclusion follows logically from the premises, i.e., whether it is possible to deduce the conclusion from the ...