Search Results for ""

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

If G is a group, then the torsion elements Tor(G) of G (also called the torsion of G) are defined to be the set of elements g in G such that g^n=e for some natural number n, ...

The number p in a fraction p/q, i.e., the dividend.

A term for number theory.

The number of empty neighbors of a cluster.

The number q in a star polygon {p/q}.

The product of any number of perspectivities.

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

All closed surfaces, despite their seemingly diverse forms, are topologically equivalent to spheres with some number of handles or cross-caps. The traditional proof follows ...