Search Results for ""

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...

Tietze's graph is the cubic graph on 12 nodes and 18 edges illustrated above in a number of embeddings. It is implemented in the Wolfram Language as GraphData["TietzeGraph"]. ...

In general, a topological index, sometimes also known as a graph-theoretic index, is a numerical invariant of a chemical graph (Plavšić et al. 1993). Particular topological ...

A topological space, also called an abstract topological space, is a set X together with a collection of open subsets T that satisfies the four conditions: 1. The empty set ...

A toroidal polyhedron is a polyhedron with genus g>=1 (i.e., one having one or more holes). Examples of toroidal polyhedra include the Császár polyhedron and Szilassi ...

The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

A transformation T (a.k.a., map, function) over a domain D takes the elements X in D to elements Y in T(D), where the range (a.k.a., image) of T is defined as ...

A transition function describes the difference in the way an object is described in two separate, overlapping coordinate charts, where the description of the same set may ...

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...