|
Odd Cycle
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with vertices is called . The number of vertices in equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it. Terminology There are many synonyms for "cycle graph". These include simple cycle graph and cyclic graph, although the latter term is less often used, because it can also refer to graphs which are merely not acyclic. Among graph theorists, cycle, polygon, or ''n''-gon are also often used. The term ''n''-cycle is sometimes used in other settings. A cycle with an even number of vertices is called an even cycle; a cycle with an odd number of vertices is called an odd cycle. Properties A cycle graph is: * 2-edge colorable, if and only if it has an even number of vertices * 2-regular * 2-ver ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other. A regular graph with vertices of degree is called a graph or regular graph of degree . Also, from the handshaking lemma, a regular graph contains an even number of vertices with odd degree. Regular graphs of degree at most 2 are easy to classify: a graph consists of disconnected vertices, a graph consists of disconnected edges, and a graph consists of a disjoint union of cycles and infinite chains. A graph is known as a cubic graph. A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number of neighbors in common, and every non-adjacent pair of vertices has the same number of neighbors in common. The smallest graphs that are regular but not strong ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bipartite Graph
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. The two sets U and V may be thought of as a coloring of the graph with two colors: if one colors all nodes in U blue, and all nodes in V red, each edge has endpoints of differing colors, as is required in the graph coloring problem.. In contrast, such a coloring is impossible in the case of a non-bipartite graph, such as a triangle: after one node is colored blue and another red, the third vertex of the triangle is connected to vertices of both colors, preventing it from being assigned either color. One often writes G=(U,V,E) to denote a bipartite graph whose partition has the parts U and V, with E denoting ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hosohedron
In spherical geometry, an -gonal hosohedron is a tessellation of lunes on a spherical surface, such that each lune shares the same two polar opposite vertices. A regular -gonal hosohedron has Schläfli symbol with each spherical lune having internal angle radians ( degrees). Hosohedra as regular polyhedra For a regular polyhedron whose Schläfli symbol is , the number of polygonal faces is : :N_2=\frac. The Platonic solids known to antiquity are the only integer solutions for ''m'' ≥ 3 and ''n'' ≥ 3. The restriction ''m'' ≥ 3 enforces that the polygonal faces must have at least three sides. When considering polyhedra as a spherical tiling, this restriction may be relaxed, since digons (2-gons) can be represented as spherical lunes, having non-zero area. Allowing ''m'' = 2 makes :N_2=\frac=n, and admits a new infinite class of regular polyhedra, which are the hosohedra. On a spherical surface, the polyhedron is represented as ''n'' abutting lunes, with interior ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dipole Graph
In graph theory, a dipole graph, dipole, bond graph, or linkage, is a multigraph consisting of two vertices connected with a number of parallel edges. A dipole graph containing edges is called the dipole graph, and is denoted by . The dipole graph is dual to the cycle graph . The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph , while the diamond crystal as an abstract graph is the maximal abelian covering graph of . Similarly to the Platonic graphs, the dipole graphs form the skeletons of the hosohedra. Their duals, the cycle graphs, form the skeletons of the dihedra A dihedron is a type of polyhedron, made of two polygon faces which share the same set of ''n'' edges. In three-dimensional Euclidean space, it is degenerate if its faces are flat, while in three-dimensional spherical space, a dihedron with flat .... References * * Jonathan L. Gross and Jay Yellen, 2006. ''Graph Theory and Its Applications, 2nd Ed.'', p. 17. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedron
A dihedron is a type of polyhedron, made of two polygon faces which share the same set of ''n'' edges. In three-dimensional Euclidean space, it is degenerate if its faces are flat, while in three-dimensional spherical space, a dihedron with flat faces can be thought of as a lens, an example of which is the fundamental domain of a lens space L(''p'',''q''). Dihedra have also been called bihedra, flat polyhedra, or doubly covered polygons. As a spherical tiling, a dihedron can exist as nondegenerate form, with two ''n''-sided faces covering the sphere, each face being a hemisphere, and vertices on a great circle. It is regular if the vertices are equally spaced. The dual of an ''n''-gonal dihedron is an ''n''-gonal hosohedron, where ''n'' digon faces share two vertices. As a flat-faced polyhedron A dihedron can be considered a degenerate prism whose two (planar) ''n''-sided polygon bases are connected "back-to-back", so that the resulting object has no depth. The polygons must b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Platonic Graph
In the mathematical field of graph theory, a Platonic graph is a graph that has one of the Platonic solids as its skeleton. There are 5 Platonic graphs, and all of them are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, edge-transitive and planar graphs), and also Hamiltonian graphs.Read, R. C. and Wilson, R. J. ''An Atlas of Graphs'', Oxford, England: Oxford University Press, 2004 reprint, Chapter 6 ''special graphs'' pp. 261, 266. * Tetrahedral graph – 4 vertices, 6 edges * Octahedral graph – 6 vertices, 12 edges * Cubical graph – 8 vertices, 12 edges * Icosahedral graph – 12 vertices, 30 edges * Dodecahedral graph – 20 vertices, 30 edges See also * Regular map (graph theory) * Archimedean graph *Wheel graph A wheel is a circular component that is intended to rotate on an axle bearing. The wheel is one of the key components of the wheel and axle which is one of the six simple machines. Wheels, in conjunction ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetric Graph
In the mathematical field of graph theory, a graph is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices and of , there is an automorphism :f : V(G) \rightarrow V(G) such that :f(u_1) = u_2 and f(v_1) = v_2. In other words, a graph is symmetric if its automorphism group acts transitively on ordered pairs of adjacent vertices (that is, upon edges considered as having a direction). Such a graph is sometimes also called -transitive or flag-transitive. By definition (ignoring and ), a symmetric graph without isolated vertices must also be vertex-transitive. Since the definition above maps one edge to another, a symmetric graph must also be edge-transitive. However, an edge-transitive graph need not be symmetric, since might map to , but not to . Star graphs are a simple example of being edge-transitive without being vertex-transitive or symmetric. As a further example, semi-symmetric graphs are edge-transitive and regular, but not vertex-transitiv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedral Group
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry. The notation for the dihedral group differs in geometry and abstract algebra. In geometry, or refers to the symmetries of the -gon, a group of order . In abstract algebra, refers to this same dihedral group. This article uses the geometric convention, . Definition Elements A regular polygon with n sides has 2n different symmetries: n rotational symmetries and n reflection symmetries. Usually, we take n \ge 3 here. The associated rotations and reflections make up the dihedral group \mathrm_n. If n is odd, each axis of symmetry connects the midpoint of one side to the opposite vertex. If n is even, there are n/2 axes of symmetry connecting the midpoints of opposite sides and n/2 axes of symmetry connecting oppo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automorphism Group
In mathematics, the automorphism group of an object ''X'' is the group consisting of automorphisms of ''X'' under composition of morphisms. For example, if ''X'' is a finite-dimensional vector space, then the automorphism group of ''X'' is the group of invertible linear transformations from ''X'' to itself (the general linear group of ''X''). If instead ''X'' is a group, then its automorphism group \operatorname(X) is the group consisting of all group automorphisms of ''X''. Especially in geometric contexts, an automorphism group is also called a symmetry group. A subgroup of an automorphism group is sometimes called a transformation group. Automorphism groups are studied in a general way in the field of category theory. Examples If ''X'' is a set with no additional structure, then any bijection from ''X'' to itself is an automorphism, and hence the automorphism group of ''X'' in this case is precisely the symmetric group of ''X''. If the set ''X'' has additional struct ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polygon
In Euclidean geometry, a regular polygon is a polygon that is Equiangular polygon, direct equiangular (all angles are equal in measure) and Equilateral polygon, equilateral (all sides have the same length). Regular polygons may be either convex polygon, convex, star polygon, star or Skew polygon, skew. In the limit (mathematics), limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a Line (geometry), straight line), if the edge length is fixed. General properties ''These properties apply to all regular polygons, whether convex or star polygon, star.'' A regular ''n''-sided polygon has rotational symmetry of order ''n''. All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon. Together with the property of equal-length sides, this implies that every regular p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Drawing
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graph (discrete mathematics), graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics. A drawing of a graph or network diagram is a pictorial representation of the vertex (graph theory), vertices and edge (graph theory), edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph., p. 6. In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and aesthetics. The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's menta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unit Distance Graph
In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some non-adjacent pairs of vertices to be at distance one, they may also be called strict unit distance graphs or faithful unit distance graphs. As a hereditary family of graphs, they can be characterized by forbidden induced subgraphs. The unit distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict unit distance graphs. An unsolved problem of Paul Erdős asks how many edges a unit distance graph on n vertices can have. The best known lower bound is slightly above linear in n—far from the upper bound, proportional to n^. The number of colors required to color unit distance graphs is also unknown (t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
