Search Results for ""

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 ...

lnx is the notation used in physics and engineering to denote the logarithm to base e, also called the natural logarithm, i.e., lnx=log_ex. The United States Department of ...

The unique magic square of order three. The Lo Shu is an associative magic square, but not a panmagic square.

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

The study of number fields by embedding them in a local field is called local class field theory. Information about an equation in a local field may give information about ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

A lattice L is locally bounded if and only if each of its finitely generated sublattices is bounded. Every locally bounded lattice is locally subbounded, and every locally ...

A topological space X is locally compact if every point has a neighborhood which is itself contained in a compact set. Many familiar topological spaces are locally compact, ...