|
Cube Graph
In graph theory, the hypercube graph is the graph formed from the vertices and edges of an -dimensional hypercube. For instance, the cube graph is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. has vertices, edges, and is a regular graph with edges touching each vertex. The hypercube graph may also be constructed by creating a vertex for each subset of an -element set, with two vertices adjacent when their subsets differ in a single element, or by creating a vertex for each -digit binary number, with two vertices adjacent when their binary representations differ in a single digit. It is the -fold Cartesian product of the two-vertex complete graph, and may be decomposed into two copies of connected to each other by a perfect matching. Hypercube graphs should not be confused with cubic graphs, which are graphs that have exactly three edges touching each vertex. The only hypercube graph that is a cubic graph is the cubical graph . Constru ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Möbius Configuration
In geometry, the Möbius configuration or Möbius tetrads is a certain configuration in Euclidean space or projective space, consisting of two mutually inscribed tetrahedra: each vertex of one tetrahedron lies on a face plane of the other tetrahedron and vice versa. Thus, for the resulting system of eight points and eight planes, each point lies on four planes (the three planes defining it as a vertex of a tetrahedron and the fourth plane from the other tetrahedron that it lies on), and each plane contains four points (the three tetrahedron vertices of its face, and the vertex from the other tetrahedron that lies on it). Möbius's theorem The configuration is named after August Ferdinand Möbius, who in 1828 proved that, if two tetrahedra have the property that seven of their vertices lie on corresponding face planes of the other tetrahedron, then the eighth vertex also lies on the plane of its corresponding face, forming a configuration of this type. This incidence theorem is tru ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Levi Graph
In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure.. See in particulap. 181 From a collection of points and lines in an incidence geometry or a projective configuration, we form a graph with one vertex per point, one vertex per line, and an edge for every incidence between a point and a line. They are named for Friedrich Wilhelm Levi, who wrote about them in 1942. The Levi graph of a system of points and lines usually has girth at least six: Any 4- cycles would correspond to two lines through the same two points. Conversely any bipartite graph with girth at least six can be viewed as the Levi graph of an abstract incidence structure. Levi graphs of configurations are biregular, and every biregular graph with girth at least six can be viewed as the Levi graph of an abstract configuration.. Levi graphs may also be defined for other types of incidence structure, such as the incidences between points and planes in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edge (geometry)
In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces (or polyhedron sides) meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. Relation to edges in graphs In graph theory, an edge is an abstract object connecting two graph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges. Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitz's theore ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (geometry)
In geometry, a vertex (in plural form: vertices or vertexes) is a point (geometry), point where two or more curves, line (geometry), lines, or edge (geometry), edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedron, polyhedra are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two Line (mathematics)#Ray, rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection (Euclidean geometry), intersection of Edge (geometry), edges, face (geometry), faces or facets of the object. In a polygon, a vertex is called "convex set, convex" if the internal an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cube
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex. Viewed from a corner it is a hexagon and its net is usually depicted as a cross. The cube is the only regular hexahedron and is one of the five Platonic solids. It has 6 faces, 12 edges, and 8 vertices. The cube is also a square parallelepiped, an equilateral cuboid and a right rhombohedron a 3-zonohedron. It is a regular square prism in three orientations, and a trigonal trapezohedron in four orientations. The cube is dual to the octahedron. It has cubical or octahedral symmetry. The cube is the only convex polyhedron whose faces are all squares. Orthogonal projections The ''cube'' has four special orthogonal projections, centered, on a vertex, edges, face and normal to its vertex figure. The first and third correspond to the A2 and B2 Coxeter planes. Spherical tiling The cube can also be represented as a spherical tiling, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
N-skeleton
In mathematics, particularly in algebraic topology, the of a topological space presented as a simplicial complex (resp. CW complex) refers to the subspace that is the union of the simplices of (resp. cells of ) of dimensions In other words, given an inductive definition of a complex, the is obtained by stopping at the . These subspaces increase with . The is a discrete space, and the a topological graph. The skeletons of a space are used in obstruction theory, to construct spectral sequences by means of filtrations, and generally to make inductive arguments. They are particularly important when has infinite dimension, in the sense that the do not become constant as In geometry In geometry, a of P (functionally represented as skel''k''(''P'')) consists of all elements of dimension up to ''k''. For example: : skel0(cube) = 8 vertices : skel1(cube) = 8 vertices, 12 edges : skel2(cube) = 8 vertices, 12 edges, 6 square faces For simplicial sets The above def ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cycle (graph Theory)
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal. A graph without cycles is called an ''acyclic graph''. A directed graph without directed cycles is called a ''directed acyclic graph''. A connected graph without cycles is called a ''tree''. Definitions Circuit and cycle * A circuit is a non-empty trail in which the first and last vertices are equal (''closed trail''). : Let be a graph. A circuit is a non-empty trail with a vertex sequence . * A cycle or simple circuit is a circuit in which only the first and last vertices are equal. Directed circuit and directed cycle * A directed circuit is a non-empty directed trail in which the first and last vertices are equal (''closed directed trail''). : Let be a directed graph. A directed circuit is a non-empty directed trail with a vertex sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamming Graph
Hamming graphs are a special class of graphs named after Richard Hamming and used in several branches of mathematics (graph theory) and computer science. Let be a set of elements and a positive integer. The Hamming graph has vertex set , the set of ordered -tuples of elements of , or sequences of length from . Two vertices are adjacent if they differ in precisely one coordinate; that is, if their Hamming distance is one. The Hamming graph is, equivalently, the Cartesian product of complete graphs .. In some cases, Hamming graphs may be considered more generally as the Cartesian products of complete graphs that may be of varying sizes.. Unlike the Hamming graphs , the graphs in this more general class are not necessarily distance-regular, but they continue to be regular and vertex-transitive. Special cases *, which is the generalized quadrangle *, which is the complete graph . *, which is the lattice graph and also the rook's graph *, which is the singleton gr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Disjoint Union
In mathematics, a disjoint union (or discriminated union) of a family of sets (A_i : i\in I) is a set A, often denoted by \bigsqcup_ A_i, with an injection of each A_i into A, such that the images of these injections form a partition of A (that is, each element of A belongs to exactly one of these images). A disjoint union of a family of pairwise disjoint sets is their union. In category theory, the disjoint union is the coproduct of the category of sets, and thus defined up to a bijection. In this context, the notation \coprod_ A_i is often used. The disjoint union of two sets A and B is written with infix notation as A \sqcup B. Some authors use the alternative notation A \uplus B or A \operatorname B (along with the corresponding \biguplus_ A_i or \operatorname_ A_i). A standard way for building the disjoint union is to define A as the set of ordered pairs (x, i) such that x \in A_i, and the injection A_i \to A as x \mapsto (x, i). Example Consider the sets A_0 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
