Journal of applied mathematics & informatics
- Volume 25 Issue 1_2
- /
- Pages.283-291
- /
- 2007
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
SOME RESULTS ON FRACTIONAL n-FACTOR-CRITICAL GRAPHS
- Yu, Jiguo (School of computer Science, Qufu Normal University) ;
- Bian, Qiuju (School of Mathematics and Information science, Shandong University of Technology) ;
- Liu, Guizhen (School of Mathematics and system Science, Shandong University) ;
- Wang, Na (School of computer Science, Qufu Normal University)
- Published : 2007.09.30
Abstract
A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.
Keywords