Search Results for ""

In general, a triakis tetrahedron is a non-regular dodecahedron that can be constructed as a positive augmentation of a regular tetrahedron. Such a solid is also known as a ...

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

The circumradius of a cyclic polygon is a radius of the circle inside which the polygon can be inscribed. Similarly, the circumradius of a polyhedron is the radius of a ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

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

A dodecagon is a 12-sided polygon. Several special types of dodecagons are illustrated above. In particular, a dodecagon with vertices equally spaced around a circle and with ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

The Johnson solids are the convex polyhedra having regular faces and equal edge lengths (with the exception of the completely regular Platonic solids, the "semiregular" ...

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

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.