The Petersen Graph information

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

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

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

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

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

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

The Petersen graph, which is also a distance-regular graph, is one of only 5 known connected vertex-transitive graphs with no Hamiltonian cycles. The...

graphs, forming the start of the Foster census. Many well-known individual graphs are cubic and symmetric, including the utility graph, the Petersen graph...

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

1) is the odd graph On; in particular O3 = K(5, 2) is the Petersen graph (see top right figure). The Kneser graph O4 = K(7, 3), visualized on the right...

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

a ten-vertex graph, the complement of the Petersen graph, which can also be formed as the bipartite half of the 20-vertex Desargues graph. There are several...

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

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

defined from certain set systems. They include and generalize the Petersen graph. The odd graphs have high odd girth, meaning that they contain long odd-length...

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

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

embedding. A graph has a linkless embedding if and only if it does not have one of the seven graphs of the Petersen family as a minor. The Petersen graph and associated...

Moore graph with girth 5 and degree 57 exist? (more unsolved problems in mathematics) In graph theory, a Moore graph is a regular graph whose girth (the shortest...

In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same...

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

graph with exactly two different vertex degrees. The strongly regular geodetic graphs include the 5-vertex cycle graph, the Petersen graph, and the Hoffman–Singleton...