Search Results for ""

A vertex is a special point of a mathematical object, and is usually a location where two or more lines or edges meet. Vertices are most commonly encountered in angles, ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...

The Menger sponge is a fractal which is the three-dimensional analog of the Sierpiński carpet. The nth iteration of the Menger sponge is implemented in the Wolfram Language ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...