Search Results for ""

The polyhedron resulting from letting each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces.

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...

The conjecture that the maximum local density is given by rho_(dodecahedron).

A local extremum, also called a relative extremum, is a local minimum or local maximum.

The study of a finite group G using the local subgroups of G. Local group theory plays a critical role in the classification theorem of finite groups.

A local maximum, also called a relative maximum, is a maximum within some neighborhood that need not be (but may be) a global maximum.

A local minimum, also called a relative minimum, is a minimum within some neighborhood that need not be (but may be) a global minimum.

A topological space is locally connected at the point x if every neighborhood of x contains a connected open neighborhood. It is called locally connected if it is locally ...