polyhedral pair
1Polyhedral skeletal electron pair theory — In chemistry the polyhedral skeletal electron pair theory provides electron counting rules useful for predicting the structures of clusters such as borane and carborane clusters. The electron counting rules were originally formulated by Kenneth… …
2Polyhedral symbol — The polyhedral symbol is sometimes used in coordination chemistry to indicate the approximate geometry of the coordinating atoms around the central atom. One or more italicised letters indicate the geometry, e.g. TP 3 which is followed by a… …
3Electron pair — In chemistry, an electron pair consists of two electrons that occupy the same orbital but have opposite spins.Because electrons are fermions, the Pauli exclusion principle forbids these particles from having exactly the same quantum numbers.… …
4Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
5Platonic solid — In geometry, a Platonic solid is a convex polyhedron that is regular, in the sense of a regular polygon. Specifically, the faces of a Platonic solid are congruent regular polygons, with the same number of faces meeting at each vertex; thus, all… …
6Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) …
7Dice — For other uses, see Dice (disambiguation). Four coloured dice showing all six possible sides (on a right handed, 6 sided die with pips) A die (plural dice, from Old French dé, from Latin datum something which is given or played )[1] …
8Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… …
9Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane …
10Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? …
