Search Results for ""

Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

An Archimedean spiral with polar equation r=a/theta. (1) The hyperbolic spiral, also called the inverse spiral (Whittaker 1944, p. 83), originated with Pierre Varignon in ...

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

An example of a subspace of the Euclidean plane that is connected but not pathwise-connected with respect to the relative topology. It is formed by the ray y=0, x<=0 and the ...

A surface such as the Möbius strip or Klein bottle (Gray 1997, pp. 322-323) on which there exists a closed path such that the directrix is reversed when moved around this ...