DocumentCode
2652248
Title
Notice of Retraction
Some sufficient and necessary conditions for defect n-extendable graphs
Author
Xuelian Wen
Author_Institution
Sch. of Econ. & Manage., South China Normal Univ., Guangzhou, China
Volume
7
fYear
2010
fDate
16-18 April 2010
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.
A near perfect matching is a matching covering all but one vertex in a graph. Let G be a connected graph and n≤(|V (G)|-2)/2 be a positive integer. If any n independent edges in G are contained in a near perfect matching, then G is said to be defect n-extendable. In this paper, we first show that if G is a graph with odd order and δ(G) ≥ (|V (G)| - 1)/2 + n, then G is defect n-extendable. We also construct a graph to show that the bound for δ(G) is sharp. Then we give a characterization of defect n-extendable graph and some properties of defect 1-extendable graphs.
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.
A near perfect matching is a matching covering all but one vertex in a graph. Let G be a connected graph and n≤(|V (G)|-2)/2 be a positive integer. If any n independent edges in G are contained in a near perfect matching, then G is said to be defect n-extendable. In this paper, we first show that if G is a graph with odd order and δ(G) ≥ (|V (G)| - 1)/2 + n, then G is defect n-extendable. We also construct a graph to show that the bound for δ(G) is sharp. Then we give a characterization of defect n-extendable graph and some properties of defect 1-extendable graphs.
Keywords
graph theory; graphs; defect n-extendable graphs; near perfect matching; positive integer; Bipartite graph; Terminology; Turning; A near perfect matching; defect n-extendable;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Engineering and Technology (ICCET), 2010 2nd International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6347-3
Type
conf
DOI
10.1109/ICCET.2010.5485590
Filename
5485590
Link To Document