Search Results for ""

A marked point process with mark space E is a double sequence (T,Y)=((T_n)_(n>=1),(Y_n)_(n>=1)) of R^^^+-valued random variables and E^_-valued random variables Y_n defined ...

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

Meißner (1911) showed how to modify the Reuleaux tetrahedron (which is not a solid of constant width) to form a surface of constant width by replacing three of its edge arcs ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...

A knot which is not alternating. Unlike alternating knots, flype moves are not sufficient to pass between all minimal diagrams of a given nonalternating knot (Hoste et al. ...

PEMDAS is an acronym used primarily in the United States as a mechanism to pedagogically enforce the order rules of computational precedence. PEMDAS is explained as follows: ...

The fraction of odd values of the partition function P(n) is roughly 50%, independent of n, whereas odd values of Q(n) occur with ever decreasing frequency as n becomes ...

A planar connected graph is a graph which is both planar and connected. The numbers of planar connected graphs with n=1, 2, ... nodes are 1, 1, 2, 6, 20, 99, 646, 5974, ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...