JOURNAL BROWSE
Search
Advanced SearchSearch Tips
TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
Gao, Wei; Liang, Li; Xu, Tianwei; Zhou, Juxiang;
  PDF(new window)
 Abstract
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 . This bound is sharp in some sense. Furthermore, the best toughness condition for fractional (a, b, n)-critical graphs is given.
 Keywords
toughness;fractional (g, f)-factor;fractional (g, f, n)-critical graph;fractional (a, b, n)-critical graph;
 Language
English
 Cited by
1.
Toughness Condition for a Graph to Be a Fractional(g,f,n)-Critical Deleted Graph, The Scientific World Journal, 2014, 2014, 1  crossref(new windwow)
 References
1.
Q. Bian, On toughness and fractional f-factors, Ars Combin. 87 (2008), 175-180.

2.
J. A. Bondy and U. S. R. Mutry, Graph Theory, Spring, Berlin, 2008.

3.
V. Chvatal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973), 215-228. crossref(new window)

4.
G. Liu and L. Zhang, Fractional (g, f)-factors of graphs, Acta Math. Sci. Ser. B Engl. Ed. 21 (2001), no. 4, 541-545.

5.
G. Liu and L. Zhang, Characterizations of maximum fractional (g, f)-factors of graphs, Discrete Appl. Math. 156 (2008), no. 12, 2293-2299. crossref(new window)

6.
G. Liu and L. Zhang, Toughness and the existence of fractional k-factors of graphs, Discrete Math. 308 (2008), no. 9, 1741-1748. crossref(new window)

7.
S. Liu, On toughness and fractional (g, f, n)-critical graphs, Inform. Process. Lett. 110 (2010), no. 10, 378-382. crossref(new window)

8.
S. Liu and J. Cai, Toughness and existence of fractional (g, f)-factors in graphs, Ars Combin. 93 (2009), 305-311.

9.
S. Zhou, Independence number, connectivity and (a, b, k)-critical graphs, Discrete Math. 309 (2009), no. 12, 4144-4148. crossref(new window)

10.
S. Zhou, A sufficient condition for a graph to be an (a, b, k)-critical graph, Int. J. Comput. Math. 87 (2010), no. 10, 2202-2211. crossref(new window)