Search Results for ""

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...

In its original form, the Poincaré conjecture states that every simply connected closed three-manifold is homeomorphic to the three-sphere (in a topologist's sense) S^3, ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

The sine function sinx is one of the basic functions encountered in trigonometry (the others being the cosecant, cosine, cotangent, secant, and tangent). Let theta be an ...

In general, a tetrahedron is a polyhedron with four sides. If all faces are congruent, the tetrahedron is known as an isosceles tetrahedron. If all faces are congruent to an ...

The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...

Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...