|
Petersen Graph
In the mathematics, mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertex (graph theory), vertices and 15 edge (graph theory), edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest Bridge (graph theory), bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by . Kempe observed that its vertices can represent the ten lines of the Desargues configuration, and its edges represent pairs of lines that do not meet at one of the ten points of the configuration. Donald Knuth states that the Petersen graph is "a remarkable configuration that serves as a counterexample to many optimistic predictions about what might be true for graphs in general." The Petersen graph also makes an appearanc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Julius Petersen
Julius Peter Christian Petersen (16 June 1839, Sorø, West Zealand – 5 August 1910, Copenhagen) was a Danish mathematician. His contributions to the field of mathematics led to the birth of graph theory. Biography Petersen's interests in mathematics were manifold, including: geometry, complex analysis, number theory, mathematical physics, mathematical economics, cryptography and graph theory. His famous paper ''Die Theorie der regulären graphs'' was a fundamental contribution to modern graph theory as we know it today. In 1898, he presented a counterexample to Tait's claimed theorem about 1-factorability of 3-regular graphs, which is nowadays known as the " Petersen graph". In cryptography and mathematical economics he made contributions which today are seen as pioneering. He published a systematic treatment of geometrical constructions (with straightedge and compass) in 1880. A French translation was reprinted in 1990. A special issue of Discrete Mathematic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kneser Graph KG(5,2)
Kneser is a surname. Notable people with the surname include: *Adolf Kneser (1862–1930), mathematician *Hellmuth Kneser (1898–1973), mathematician, son of Adolf Kneser *Martin Kneser Martin Kneser (21 January 1928 – 16 February 2004) was a German mathematician. His father Hellmuth Kneser and grandfather Adolf Kneser were also mathematicians. He obtained his PhD in 1950 from Humboldt University of Berlin with the disse ... (1928–2004), mathematician, son of Hellmuth Kneser {{surname, Kneser ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1-planar Graph
In topological graph theory, a 1-planar graph is a graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing point, where it crosses a single additional edge. If a 1-planar graph, one of the most natural generalizations of planar graphs, is drawn that way, the drawing is called a 1-plane graph or 1-planar embedding of the graph. Coloring 1-planar graphs were first studied by , who showed that they can be colored with at most seven colors. Later, the precise number of colors needed to color these graphs, in the worst case, was shown to be six.. The example of the complete graph ''K''6, which is 1-planar, shows that 1-planar graphs may sometimes require six colors. However, the proof that six colors are always enough is more complicated. Ringel's motivation was in trying to solve a variation of total coloring for planar graphs, in which one simultaneously colors the vertices and faces of a planar graph in such a way that no two adjacent ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Petersen Graph, Two Crossings
Petersen is a common Danish patronymic surname, meaning ''"son of Peter"''. There are other spellings. Petersen may refer to: People In arts and entertainment * Adolf Dahm-Petersen, Norwegian voice specialist * Anja Petersen, German operatic soprano and university lecturer * Anker Eli Petersen, Faroese writer and artist * Ann Petersen, Belgian actress * Chris Petersen (born 1963), American child actor * Devon Petersen (born 1986), South African darts player * Elmer Petersen, American artist * Gustaf Munch-Petersen, Danish writer and painter * Joel Petersen, bass guitarist * John Hahn-Petersen, Danish actor * Josef Petersen, Danish novelist * Patrick Petersen, American actor * Paul Petersen, American movie actor, singer, novelist, and activist * Robert E. Petersen, publisher, auto museum founder * Robert Storm Petersen, Danish cartoonist, writer, animator, illustrator, painter and humorist * Sandy Petersen, American game designer * Uwe Fahrenkrog-Petersen, German musician * Wil ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perfect Matching
In graph theory, a perfect matching in a graph is a matching that covers every vertex of the graph. More formally, given a graph , a perfect matching in is a subset of edge set , such that every vertex in the vertex set is adjacent to exactly one edge in . A perfect matching is also called a 1-factor; see Graph factorization for an explanation of this term. In some literature, the term complete matching is used. Every perfect matching is a maximum-cardinality matching, but the opposite is not true. For example, consider the following graphs: : In graph (b) there is a perfect matching (of size 3) since all 6 vertices are matched; in graphs (a) and (c) there is a maximum-cardinality matching (of size 2) which is not perfect, since some vertices are unmatched. A perfect matching is also a minimum-size edge cover. If there is a perfect matching, then both the matching number and the edge cover number equal . A perfect matching can only occur when the graph has an even n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complete Bipartite Graph
In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set..Electronic edition page 17. Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete bipartite graphs were already printed as early as 1669, in connection with an edition of the works of Ramon Llull edited by Athanasius Kircher. Llull himself had made similar drawings of complete graphs three centuries earlier.. Definition A complete bipartite graph is a graph whose vertices can be partitioned into two subsets and such that no edge has both endpoints in the same subset, and every possible edge that could connect vertices in different subsets is part of the graph. That is, it is a bipartite graph such that for every two vertices and, is an edge in . A complete bipartite graph ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complete Graph
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction). Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, had already appeared in the 13th century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose. Properties The complete graph on vertices is denoted by . Some sources claim that the letter in this notation stands for the German word , but the German name for a complete graph, , does not contain the letter , and other sources state that the notation honors the contributions of Kazimierz Kuratowski to graph theory. has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minor (graph Theory)
Minor may refer to: * Minor (law), a person under the age of certain legal activities. ** A person who has not reached the age of majority * Academic minor, a secondary field of study in undergraduate education Music theory * Minor chord ** Barbershop seventh chord or minor seventh chord * Minor interval * Minor key * Minor scale Mathematics * Minor (graph theory), the relation of one graph to another given certain conditions * Minor (linear algebra), the determinant of a certain submatrix People * Charles Minor (1835–1903), American college administrator * Charles A. Minor (21st-century), Liberian diplomat * Dan Minor (1909–1982), American jazz trombonist * Dave Minor (1922–1998), American basketball player * James T. Minor, US academic administrator and sociologist * Jerry Minor (born 1969), American actor, comedian and writer * Kyle Minor (born 1976), American writer * Mike Minor (actor) (born 1940), American actor * Mike Minor (baseball) (born 1987), Ameri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Planar Graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded by combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as the absence of isthmuses, is called ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dodecahedron
In geometry, a dodecahedron (Greek , from ''dōdeka'' "twelve" + ''hédra'' "base", "seat" or "face") or duodecahedron is any polyhedron with twelve flat faces. The most familiar dodecahedron is the regular dodecahedron with regular pentagons as faces, which is a Platonic solid. There are also three regular star dodecahedra, which are constructed as stellations of the convex form. All of these have icosahedral symmetry, order 120. Some dodecahedra have the same combinatorial structure as the regular dodecahedron (in terms of the graph formed by its vertices and edges), but their pentagonal faces are not regular: The pyritohedron, a common crystal form in pyrite, has pyritohedral symmetry, while the tetartoid has tetrahedral symmetry. The rhombic dodecahedron can be seen as a limiting case of the pyritohedron, and it has octahedral symmetry. The elongated dodecahedron and trapezo-rhombic dodecahedron variations, along with the rhombic dodecahedra, are space-filling. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hemi-dodecahedron
A hemi-dodecahedron is an abstract regular polyhedron, containing half the faces of a regular dodecahedron. It can be realized as a projective polyhedron (a tessellation of the real projective plane by 6 pentagons), which can be visualized by constructing the projective plane as a hemisphere where opposite points along the boundary are connected and dividing the hemisphere into three equal parts. It has 6 pentagonal faces, 15 edges, and 10 vertices. Projections It can be projected symmetrically inside of a 10-sided or 12-sided perimeter: : Petersen graph From the point of view of graph theory this is an embedding of the Petersen graph on a real projective plane. With this embedding, the dual graph is ''K''6 (the complete graph with 6 vertices) --- see hemi-icosahedron. See also *57-cell – an abstract regular 4-polytope constructed from 57 hemi-dodecahedra. *hemi-icosahedron A hemi-icosahedron is an abstract regular polyhedron, containing half the faces of a regular icos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Odd Graph
In the mathematical field of graph theory, the odd graphs ''On'' are a family of symmetric graphs with high odd girth, defined from certain set systems. They include and generalize the Petersen graph. Definition and examples The odd graph ''On'' has one vertex for each of the (''n'' − 1)-element subsets of a (2''n'' − 1)-element set. Two vertices are connected by an edge if and only if the corresponding subsets are disjoint. That is, ''On'' is the Kneser graph ''KG''(2''n'' − 1,''n'' − 1). ''O''2 is a triangle, while ''O''3 is the familiar Petersen graph. The generalized odd graphs are defined as distance-regular graphs with diameter ''n'' − 1 and odd girth 2''n'' − 1 for some ''n''. They include the odd graphs and the folded cube graphs. History and applications Although the Petersen graph has been known since 1898, its definition as an odd graph dates to the work of , who also stu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Petersen Graph")
