Search Results for ""

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

A topology tau on a topological vector space X=(X,tau) (with X usually assumed to be T2) is said to be locally convex if tau admits a local base at 0 consisting of balanced, ...

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

A lattice L is locally subbounded if and only if each of its finite subsets is contained in a finitely generated bounded sublattice of L. Every locally bounded lattice is ...

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...