Family of cubic graphs formed from regular and star polygons
The Dürer graph G(6, 2).
In graph theory, the generalized Petersen graphs are a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. They include the Petersen graph and generalize one of the ways of constructing the Petersen graph. The generalized Petersen graph family was introduced in 1950 by H. S. M. Coxeter[1] and was given its name in 1969 by Mark Watkins.[2]
^Coxeter, H. S. M. (1950), "Self-dual configurations and regular graphs", Bulletin of the American Mathematical Society, 56 (5): 413–455, doi:10.1090/S0002-9904-1950-09407-5.
^Watkins, Mark E. (1969), "A Theorem on Tait Colorings with an Application to the Generalized Petersen Graphs", Journal of Combinatorial Theory, 6 (2): 152–164, doi:10.1016/S0021-9800(69)80116-X.
and 24 Related for: Generalized Petersen graph information
mathematical field of graph theory, the Petersengraph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...
the generalizedPetersengraph G(9,2) is non-planar, triangle-free, and uniquely 3-edge-colorable. For many years it was the only known such graph, and...
20-vertex Desargues graph. There are several different ways of constructing the Desargues graph: It is the generalizedPetersengraph G(10,3). To form the...
(24,5). So the Nauru graph is one of only seven symmetric GeneralizedPetersengraphs. Among these seven graphs are the cubical graph G ( 4 , 1 ) {\displaystyle...
The Good Pub Guide, recommends pubs in the UK GeneralizedPetersengraph, a type of mathematical graph Guinness Peat Group, an investment holding company...
a graph. It is one of 5 Platonic graphs, each a skeleton of its Platonic solid. This graph can also be constructed as the generalizedPetersengraph G(10...
for n ≥ 2. The only known nonplanar uniquely 3-colorable graph is the generalizedPetersengraph G(9,2), and it has been conjectured that no others exist...
Heawood graph, the complete graph K7 (and hence K5 and K6), the Petersengraph (and hence the complete bipartite graph K3,3, since the Petersengraph contains...
distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalizedPetersengraphs are non-strict...
In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of...
the Petersengraph and of generalizedPetersengraphs. As with the Moser spindle, the coordinates of the unit-distance embedding of the Golomb graph can...
mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...
graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...
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...
of graph theory, the odd graphs are a family of symmetric graphs defined from certain set systems. They include and generalize the Petersengraph. The...
3-regular graph is planar and bipartite, when it is a Halin graph, when it is itself a prism or Möbius ladder, or when it is a generalizedPetersengraph of...
Hamiltonian graphs are biconnected, but a biconnected graph need not be Hamiltonian (see, for example, the Petersengraph). An Eulerian graph G (a connected...
planarity of graphs formed by using a perfect matching to connect two copies of a base graph (for instance, many of the generalizedPetersengraphs are formed...
smallest hypohamiltonian graph is the Petersengraph (Herz, Duby & Vigué 1967). More generally, the generalizedPetersengraph GP(n,2) is hypohamiltonian...
non-isomorphic graphs tied for being the smallest cubic graph that requires eight crossings. Another of these three graphs is the generalizedPetersengraph G(12...
mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...
same construction allows any generalizedPetersengraph GP(n,k) to be constructed as a derived graph of the same dumbbell graph with labels 1, 0, and k in...
Global Information