Search Results for ""

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

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 area Delta (sometimes also denoted sigma) of a triangle DeltaABC with side lengths a, b, c and corresponding angles A, B, and C is given by Delta = 1/2bcsinA (1) = ...

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

The best known packings of equilateral triangles into an equilateral triangle are illustrated above for the first few cases (Friedman). The best known packings of equilateral ...

Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...

The 14-faced Archimedean solid with faces 8{3}+6{8}. It is also the uniform polyhedron with Maeder index 9 (Maeder 1997), Wenninger index 8 (Wenninger 1989), Coxeter index 21 ...

The truncated dodecahedron is the 32-faced Archimedean solid with faces 20{3}+12{10}. It is also uniform polyhedron with Maeder index 26 (Maeder 1997), Wenninger index 10 ...

The truncated tetrahedron is the Archimedean solid with faces 4{3}+4{6}. It is also the uniform polyhedron with Maeder index 2 (Maeder 1997), Wenninger index 6 (Wenninger ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...