Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 369798, 7 pages
http://dx.doi.org/10.1155/2014/369798
Research Article

Toughness Condition for a Graph to Be a Fractional -Critical Deleted Graph

1School of Information Science and Technology, Yunnan Normal University, Kunming 650500, China
2Editorial Department of Yunnan Normal University, Kunming 650092, China

Received 16 January 2014; Revised 21 June 2014; Accepted 21 June 2014; Published 9 July 2014

Academic Editor: Abdelalim A. Elsadany

Copyright © 2014 Wei Gao and Yun Gao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  2. W. Gao, Some results on fractional deleted graphs [Ph.D. thesis], Soochow University, 2012.
  3. V. Chvátal, “Tough graphs and Hamiltonian circuits,” Discrete Mathematics, vol. 5, pp. 215–228, 1973. View at Google Scholar · View at MathSciNet · View at Scopus
  4. G. Liu and L. Zhang, “Fractional g,f-factors of graphs,” Acta Mathematica Scientia, vol. 21, no. 4, pp. 541–545, 2001. View at Google Scholar · View at Scopus
  5. G. Liu and L. Zhang, “Characterizations of maximum fractional g,f-factors of graphs,” Discrete Applied Mathematics, vol. 156, no. 12, pp. 2293–2299, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Liu, “On toughness and fractional g,f,n-critical graphs,” Information Processing Letters, vol. 110, no. 10, pp. 378–382, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. W. Gao and W. Wang, “A note on fractional (g,f,m)-deleted graphs,” Ars Combinatoria, vol. CXIIIA, pp. 129–137, 2014. View at Google Scholar
  8. W. Gao and W. Wang, “A neighborhood union condition for fractional (k;m)-deleted graphs,” Ars Combinatoria, vol. CXIIIA, pp. 225–233, 2014. View at Google Scholar
  9. S. Zhou, “Binding number and minimum degree for the existence of fractional k-factors with prescribed properties,” Utilitas Mathematica, vol. 87, pp. 123–129, 2012. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. S. Zhou, Q. Bian, and L. Xu, “Binding number and minimum degree for fractional (k,m)-deleted graphs,” Bulletin of the Australian Mathematical Society, vol. 85, no. 1, pp. 60–67, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. S. Zhou, Z. Sun, and H. Liu, “A minimum degree condition for fractional ID-[a,b]-factor-critical graphs,” Bulletin of the Australian Mathematical Society, vol. 86, no. 2, pp. 177–183, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. S. Zhou, L. Xu, and Z. Sun, “Independence number and minimum degree for fractional ID-k-factor-critical graphs,” Aequationes Mathematicae, vol. 84, no. 1-2, pp. 71–76, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Q. Bian, “On toughness and fractional f-factors,” Ars Combinatoria, vol. 87, pp. 175–180, 2008. View at Google Scholar · View at MathSciNet · View at Scopus
  14. S. Liu and J. Cai, “Toughness and existence of fractional (g, f)-factors in graphs,” Ars Combinatoria, vol. 93, no. 1, pp. 305–311, 2009. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. S. Zhou, Z. Sun, and H. Ye, “A toughness condition for fractional (k, m)-deleted graphs,” Information Processing Letters, vol. 113, no. 8, pp. 255–259, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. W. Gao, L. Liang, T. Xu, and J. Zhou, “Tight toughness condition for fractional (g, f, n)-critical graphs,” Journal of the Korean Mathematical Society, vol. 51, no. 1, pp. 55–65, 2014. View at Google Scholar
  17. G. Liu and L. Zhang, “Toughness and the existence of fractional k-factors of graphs,” Discrete Mathematics, vol. 308, no. 9, pp. 1741–1748, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. J. Yu, N. Wang, Q. Bian, and G. Liu, “Some results on fractional deleted graphs,” OR Transactions, vol. 11, no. 2, pp. 65–72, 2007 (Chinese). View at Google Scholar