TOPICS
Search

Search Results for ""


12861 - 12870 of 13135 for Computational GeometrySearch Results
The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...
Theodorus's constant sqrt(3) has decimal expansion sqrt(3)=1.732050807... (OEIS A002194). It was computed to 10^(10) decimal digits by E. Weisstein on Jul. 23, 2013. The ...
The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...
The game of tic-tac-toe, also spelled ticktacktoe and also known as 3-in-a-row or "naughts and crosses," is a game in which players alternate placing pieces (typically Xs for ...
The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...
The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...
The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...
The summatory function Phi(n) of the totient function phi(n) is defined by Phi(n) = sum_(k=1)^(n)phi(k) (1) = sum_(m=1)^(n)msum_(d|m)(mu(d))/d (2) = ...
A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...
The skeleton of a trapezohedron may be termed a trapezohedral graph. n-trapezohedral graphs are illustrated above for n=3 to 10 in circular embeddings with the two interior ...

...