Notice of RetractionNew Proof of Some Properties about Petersen Graph

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

Petersen graph plays a significant role in graph theory, it gives a clear picture of some problems in graph theory. Petersen graph has many properties that make it fascinating. In this paper, the idea about the concytic points is introduced in order to prove that Petersen graph is non-Hamiltonian graph. We give a kind of elementary proof that Petersen graph is non-planar graph. At the same time, Petersen graph, as a non-bipartite graph, has been proved as the direct corollary of Ko??nig theorem. At the end of the article, hierarchical label was introduced and the isomorphic was proved between various representations of Petersen graph.