Search Results for ""

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...

A Lindenmayer system, also known as an L-system, is a string rewriting system that can be used to generate fractals with dimension between 1 and 2. Several example fractals ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...

Little's law states that, under steady state conditions, the average number of items in a queuing system equals the average rate at which the items arrive multiplied by the ...

The Livingstone graph is a distance-transitive graph on 266 vertices defined in terms of the Janko group J_1. It has intersection array {11,10,6,1;1,1,5,11}. The Livingstone ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to the ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

The term "loop" has a number of meanings in mathematics. Most simply, a loop is a closed curve whose initial and final points coincide in a fixed point p known as the ...

Throughout abstract algebra, the term "magma" is most often used as a synonym of the more antiquated term "groupoid," referring to a set equipped with a binary operator. The ...