Search Results for ""

There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten Thomassen. These graphs, illustrated above, are implemented in the Wolfram Language as ...

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...

Transfinite induction, like regular induction, is used to show a property P(n) holds for all numbers n. The essential difference is that regular induction is restricted to ...

A transpose of a doubly indexed object is the object obtained by replacing all elements a_(ij) with a_(ji). For a second-tensor rank tensor a_(ij), the tensor transpose is ...

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other ...

In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...