Search Results for ""

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 ...

The nth taxicab number Ta(n) is the smallest number representable in n ways as a sum of positive cubes. The numbers derive their name from the Hardy-Ramanujan number Ta(2) = ...

A tiling of regular polygons (in two dimensions), polyhedra (three dimensions), or polytopes (n dimensions) is called a tessellation. Tessellations can be specified using a ...

A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...

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 ...

A (p,q)-torus knot is obtained by looping a string through the hole of a torus p times with q revolutions before joining its ends, where p and q are relatively prime. A ...

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 ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

Given a reference triangle DeltaABC, the trilinear coordinates of a point P with respect to DeltaABC are an ordered triple of numbers, each of which is proportional to the ...