They include the Petersen graph and generalize one of the ways of constructing the Petersen graph. The generalized Petersen graph family was introduced...

mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...

the generalized Petersen graph 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 generalized Petersen graph G(10,3). To form the...

Ferdinand Möbius and Seligmann Kantor. It can be defined as the generalized Petersen graph G(8,3): that is, it is formed by the vertices of an octagon, connected...

(24,5). So the Nauru graph is one of only seven symmetric Generalized Petersen graphs. Among these seven graphs are the cubical graph G ( 4 , 1 ) {\displaystyle...

In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a...

The Good Pub Guide, recommends pubs in the UK Generalized Petersen graph, a type of mathematical graph Guinness Peat Group, an investment holding company...

represented as a graph, and it is called the dodecahedral graph, a Platonic graph. This graph can also be constructed as the generalized Petersen graph G ( 10 ...

vertices of a cube graph, or as the generalized Petersen graph G(6,2). As with any graph of a convex polyhedron, the Dürer graph is a 3-vertex-connected...