Examples of 'petersen graph' in a sentence
Meaning of "petersen graph"
petersen graph ~ a specific type of mathematical structure in graph theory that represents a finite projective plane. It consists of points and lines that satisfy certain properties, named after mathematician Julius Petersen
How to use "petersen graph" in a sentence
Basic
Advanced
petersen graph
Every generalized Petersen graph is a unit distance graph.
They include and generalize the Petersen graph.
The Petersen graph also makes an appearance in tropical geometry.
Coloring the edges of the Petersen graph with three colors.
The Petersen graph and its generalizations.
Tutte conjectured that every snark has the Petersen graph as a minor.
The Petersen graph and its complement.
Relation to Petersen graph.
The Petersen graph is nonplanar.
Odd cycles are harmonious, as is the Petersen graph.
The Petersen graph has a Hamiltonian path but no Hamiltonian cycle.
The case that gives the well-known Petersen graph.
The Petersen graph has chromatic index 4 ; coloring the edges requires four colors.
This is the embedding given by the hemi-dodecahedron construction of the Petersen graph.
Despite its high degree of symmetry, the Petersen graph is not a Cayley graph.
See also
The Petersen graph has distinguishing number 3.
From the start, the smallest hypohamiltonian graph is known, the Petersen graph.
Thus, the Petersen graph has crossing number 2.
As a connected bridgeless cubic graph with chromatic index four, the Petersen graph is a snark.
Constructions = = The Petersen graph is the complement of the line graph of formula 1.
This construction forms a regular map and shows that the Petersen graph has non-orientable genus 1.
The Petersen graph itself is the only generalized Petersen graph that is not 3-edge-colorable.
The case that n 3 gives the well-known Petersen graph.
All Moore graphs, in particular the Petersen graph and the Hoffman-Singleton graph, are distance regular.
The Thue number ( a variant of the chromatic index ) of the Petersen graph is 5.
The Petersen graph is not edge-graceful.
When discovered, only one snark was known - the Petersen graph.
Embeddings = = The Petersen graph is nonplanar.
Not every regular graph has a 1-factorization ; for instance, the Petersen graph does not.
K6 is at the top of the illustration, and the Petersen graph is at the bottom.
Again, the smallest instance of Lindgren 's construction is the Petersen graph.
With this embedding, the dual graph is the Petersen graph --- see hemi-dodecahedron.
You'll also be interested in:
Examples of using Petersen
Show more
Petersen is an outspoken advocate for climate justice
We caught him attacking young casey petersen
Petersen continued to defend his titles successfully
Examples of using Graph
Show more
The following graph synthesizes this view
Graph paper sheets always come last
See the following graph for an example
