mutually connected vertices
1combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …
2Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …
3Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 …
4Pseudotriangle — In Euclidean plane geometry, a pseudotriangle is the simply connected subset of the plane that lies between any three mutually tangent convex sets. A pseudotriangulation is a partition of a region of the plane into pseudotriangles, and a pointed… …
5Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph …
6Circle 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 …
7Hypercube — This article is about the mathematical concept. For the film, see Cube 2: Hypercube. Perspective projections Cube (3 cube) Tesseract (4 cube) In geometry, a hypercube is an n dimensional analogue of a …
8Root system — This article discusses root systems in mathematics. For root systems of plants, see root. Lie groups …
9Four color theorem — Example of a four colored map A four colori …
10Manifold — For other uses, see Manifold (disambiguation). The sphere (surface of a ball) is a two dimensional manifold since it can be represented by a collection of two dimensional maps. In mathematics (specifically in differential geometry and topology),… …
