Search Results for ""

Given any two distinct points x,y, there exist neighborhoods u and v of x and y, respectively, with u intersection v=emptyset. It then follows that finite subsets are closed.

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

An ordered finite configuration with certain pairs of points, called cables, which are constrained not to get further apart and certain other pairs of points, called struts, ...

Also known as the total curvature. The linear element of the indicatrix ds_P=sqrt(ds_T^2+ds_B^2).

The third Morley adjunct triangle has trilinear vertex matrix [2 sec[1/3(C-4pi)] sec[1/3(B-4pi)]; sec[1/3(C-4pi)] 2 sec[1/3(A-4pi)]; sec[1/3(B-4pi)] sec[1/3(A-4pi)] 2]. The ...

A topological groupoid over B is a groupoid G such that B and G are topological spaces and alpha,beta, and multiplication are continuous maps. Here, alpha and beta are maps ...

A totally disconnected space is a space in which all subsets with more than one element are disconnected. In particular, if it has more than one element, it is a disconnected ...

An extension field of a field F that is not algebraic over F, i.e., an extension field that has at least one element that is transcendental over F. For example, the field of ...

An ungula is a portion of a solid of revolution obtained by cutting via a plane oblique to its base. The term derives from the Latin word ungula for the hoof of a horse. ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...