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 Petersen Graph is a mathematics book about the Petersen graph and its applications in graph theory. It was written by Derek Holton and John Sheehan...

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

matrix of a graph (this part of algebraic graph theory is also called spectral graph theory). For the Petersen graph, for example, the spectrum of the adjacency...

snark is planar. The first graph known to be a snark was the Petersen graph; it was proved to be a snark by Julius Petersen in 1898, although it had already...

and these graphs are not 1-factorable; examples of such graphs include: Any regular graph with an odd number of nodes. The Petersen graph. A 1-factorization...

graph Cameron graph Petersen graph Hall–Janko graph Hoffman–Singleton graph Higman–Sims graph Paley graph of order 13 Shrikhande graph Schläfli graph...

individual graphs are cubic and symmetric, including the utility graph, the Petersen graph, the Heawood graph, the Möbius–Kantor graph, the Pappus graph, the...

graph is a forest. More advanced kinds of graphs are: Petersen graph and its generalizations; perfect graphs; cographs; chordal graphs; other graphs with...

O3 = K(5, 2) is the Petersen graph (see top right figure). The Kneser graph O4 = K(7, 3), visualized on the right. The Kneser graph K ( n , k ) {\displaystyle...

databases. The name "Desargues graph" has also been used to refer to a ten-vertex graph, the complement of the Petersen graph, which can also be formed as...

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 it had...

The complete graph K6, the Petersen graph, and the other five graphs in the Petersen family do not have linkless embeddings. Every graph minor of a linklessly...

Heawood graph, the complete graph K7 (and hence K5 and K6), the Petersen graph (and hence the complete bipartite graph K3,3, since the Petersen graph contains...

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...

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...

contributions to the field of mathematics led to the birth of graph theory. Petersen's interests in mathematics were manifold, including: geometry, complex...

graphs (such as the Petersen graph, the Heawood graph and the vertices and edges of the Platonic solids). The finite Cayley graphs (such as cube-connected...

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...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

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

There are 525 copies of the Petersen graph, with each 6-cycle belonging to exactly one Petersen each. Removing any one Petersen leaves a copy of the unique...

In graph theory, the Petersen family is a set of seven undirected graphs that includes the Petersen graph and the complete graph K6. The Petersen family...

out" to referee the game). The case that n = 3 gives the well-known Petersen graph. As Biggs (1972) explains the problem (for n = 6), the players wish...

Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De...

In topological graph theory, an embedding (also spelled imbedding) of a graph G {\displaystyle G} on a surface Σ {\displaystyle \Sigma } is a representation...

10-cage, the Harries graph and the Harries–Wong graph. The Petersen graph has a girth of 5 The Heawood graph has a girth of 6 The McGee graph has a girth of...

In essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative...

distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict...

complete bipartite graph Kr,r on 2r vertices. Notable cages include: (3,5)-cage: the Petersen graph, 10 vertices (3,6)-cage: the Heawood graph, 14 vertices...