Search Results for ""

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

The shortest path-spanning tree from a graph vertex of a graph.

The small triambic icosahedron is the dual polyhedron of the small ditrigonal icosidodecahedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. ...

In the arbelos, consider the semicircles K_1 and K_2 with centers A and C passing through B. The Apollonius circle K_3 of K_1, K_2 and the large semicircle of the arbelos is ...

Let (K,|·|) be a non-Archimedean field. Its valuation ring R is defined to be R={x in K:|x|<=1}. The valuation ring has maximal ideal M={x in K:|x|<1}, and the field R/M is ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

An important result in valuation theory which gives information on finding roots of polynomials. Hensel's lemma is formally stated as follows. Let (K,|·|) be a complete ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

The term "rhombicosidodecahedron" is most commonly used (e.g., Wenninger 1989, p. 28; Maeder 1997. Model 27) to refer to the 62-faced Archimedean solid with faces ...