DocumentCode
515064
Title
Notice of Retraction
New Proof of Some Properties about Petersen Graph
Author
Yanzhong Hu
Author_Institution
Sch. of Comput. Sci., Hubei Univ. of Technol., Wuhan, China
Volume
2
fYear
2010
fDate
6-7 March 2010
Firstpage
609
Lastpage
611
Abstract
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.
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.
Keywords
graph theory; Ko??nig theorem; Petersen graph; bipartite graph; concytic points; graph theory; non Hamiltonian graph; Computer science; Computer science education; Educational technology; Graph theory; Hamiltonian graph; Petersen graph; concytic points; girth; hierarchical label;
fLanguage
English
Publisher
ieee
Conference_Titel
Education Technology and Computer Science (ETCS), 2010 Second International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-6388-6
Type
conf
DOI
10.1109/ETCS.2010.145
Filename
5460247
Link To Document