Petersen-Graph

The Petersen graph (named after the Danish mathematician Julius Petersen ) is a 3 -regular (ie, cubic ) graph with 10 nodes. This means that each of the nodes has three neighbors degree sequence is also ( 3,3,3,3,3,3,3,3,3,3 ). Petersen the graph in the graph theory and an example of a counter-example is often used.

Properties of Petersen graph:

  • Cubic or 3- regular ( by definition)
  • Non- planar
  • Coherently
  • Symmetrical
  • The length of the shortest loop is 5
  • Contains no Hamiltonian circuit
  • Smallest hypo- Hamiltonian graph
  • Chromatic number (graph theory ) 3
  • Chromatic index ( graph theory) 4

Petersen the graph belong to a group of contiguous, non-planar and non- bridge graphs, referred to as " Snark ".

See also: Types of graphs in graph theory in graph (graph theory )

Cubic graph Edge coloring Intersection number Chromatic polynomial Characteristic polynomial Wolfram Research
643222
de