Search Results for ""

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...

For any sets A and B, their cardinal numbers satisfy |A|<=|B| iff there is a one-to-one function f from A into B (Rubin 1967, p. 266; Suppes 1972, pp. 94 and 116). It is easy ...

A chamfered dodecahedron, inaccurately called a truncated rhombic triacontahedron or more accurately called a pentatruncated rhombic triacontahedron, is a polyhedron obtained ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

The subset C of the Euclidean plane formed by the union of the x-axis, the line segment with interval [0,1] of the y-axis, and the sequence of segments with endpoints (1/n,0) ...

A complex manifold is a manifold M whose coordinate charts are open subsets of C^n and the transition functions between charts are holomorphic functions. Naturally, a complex ...

The computational paradigm is a term introduced by Wolfram (2002, 2021) to describe the idea of using simple programs rather than mathematical equations (the latter of which ...

A space D is connected if any two points in D can be connected by a curve lying wholly within D. A space is 0-connected (a.k.a. pathwise-connected) if every map from a ...

A function, or the symbol representing a function, which corresponds to English conjunctions such as "and," "or," "not," etc. that takes one or more truth values as input and ...