- hyperoctahedral
-
Describing a graph more commonly known as the cocktail party graph
Wikipedia foundation.
hyperoctahedral
Look at other dictionaries:
Generalized permutation matrix — In mathematics, a generalized permutation matrix (or monomial matrix) is a matrix with the same nonzero pattern as a permutation matrix, i.e. there is exactly one nonzero entry in each row and each column. Unlike a permutation matrix, where the… … Wikipedia
Octahedral symmetry — The cube is the most common shape with octahedral symmetry A regular octahedron has 24 rotational (or orientation preserving) symmetries, and a symmetry order of 48 including transformations that combine a reflection and a rotation. A cube has… … Wikipedia
Factorial — n n! 0 1 1 1 2 2 3 6 4 24 5 120 6 720 7 … Wikipedia
Octahedron — For the album by The Mars Volta, see Octahedron (album). Regular Octahedron (Click here for rotating model) Type Platonic solid Elements F = 8, E = 12 V = 6 (χ = 2) Faces by sides … Wikipedia
Hypercube — 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 … Wikipedia
Coxeter group — In mathematics, a Coxeter group, named after H.S.M. Coxeter, is an abstract group that admits a formal description in terms of mirror symmetries. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry … Wikipedia
Cross-polytope — In geometry, a cross polytope,[1] orthoplex,[2] hyperoctahedron, or cocube is a regular, convex polytope that exists in any number of dimensions. The vertices of a cross polytope are all the permutations of (±1, 0, 0, …, 0). The cross polytope is … Wikipedia
Demihypercube — Not to be confused with Hemicube (geometry). Alternation of the n cube yields one of two n demicubes, as in this 3 dimensional illustration of the two tetrahedra that arise as the 3 demicubes of the 3 cube. In geometry, demihypercubes (also… … Wikipedia
cocktail party graph — noun a graph, consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder graph, and the dual graph of the hypercube Syn: hyperoctahedral graph … Wiktionary
