Search Results for ""

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

The Harries graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries-Wong graph. The Harries graph is ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

A pair of primes (p,q) that sum to an even integer 2n=p+q are known as a Goldbach partition (Oliveira e Silva). Letting r(2n) denote the number of Goldbach partitions of 2n ...

The Robertson graph is the unique (4,5)-cage graph, illustrated above. It has 19 vertices and 38 edges. It has girth 5, diameter 3, chromatic number 3, and is a quartic ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

A number traditionally associated with bad luck. A so-called baker's dozen is equal to 13. Fear of the number 13 is called triskaidekaphobia. There are 13 Archimedean solids. ...

Propositional calculus, first-order logic, and other theories in mathematical logic are defined by their axioms (or axiom schemata, plural: axiom schemata) and inference ...

The Lebesgue covering dimension is an important dimension and one of the first dimensions investigated. It is defined in terms of covering sets, and is therefore also called ...

The ordinary Onsager equation is the sixth-order ordinary differential equation (d^3)/(dx^3)[e^x(d^2)/(dx^2)(e^x(dy)/(dx))]=f(x) (Vicelli 1983; Zwillinger 1997, p. 128), ...