Journal
JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY
Volume 51, Issue 1, Pages 55-65Publisher
KOREAN MATHEMATICAL SOC
DOI: 10.4134/JKMS.2014.51.1.055
Keywords
toughness; fractional (g, f)-factor; fractional (g, f, n)-critical graph; fractional (a, b, n)-critical graph
Categories
Funding
- Key Laboratory of Educational Informatization for Nationalities, Ministry of Education
- National Natural Science Foundation of China [60903131]
- Key Science and Technology Research Project of Education Ministry [210210]
Ask authors/readers for more resources
A graph G is called a fractional (g, f, n)-critical graph if any n vertices are removed from G, then the resulting graph admits a fractional (g, f)-factor. In this paper, we determine the new toughness condition for fractional (g, f, n)-critical graphs. It is proved that G is fractional (g, f, n)-critical if t(G) >= b(2)-1+bn/a. This bound is sharp in some sense. Furthermore, the best toughness condition for fractional (a, b, n)-critical graphs is given.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
