Skip to main content
SpringerLink
Log in

Some results on fractionaln-factor-critical graphs

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

A simple graphG is said to be fractionaln-factor-critical if after deleting anyn vertices the remaining subgraph still has a fractional perfect matching. For fractionaln-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Ananchuen and A. Saito,Factor critibility and complete closure of graphs, Discrete Math.265 (2003), 13–21.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, MacMillan Press Ltd, London, 1976.

    Google Scholar 

  3. O. Favaron.On n-factor-critical graphs, Discussiones Math. Graph Theory16 (1996), 41–51.

    MATH  MathSciNet  Google Scholar 

  4. O. Favaron and M. Shi,Minimally k-factor-critical graphs, Austra. J. Combin.17 (1998), 89–97.

    MATH  MathSciNet  Google Scholar 

  5. Guizhen Liu and Lanju Zhang,Fractional (g, f)-factors of graphs, Acta Mathematica Scientia21B4 (2001), 541–545.

    Google Scholar 

  6. Yinghong Ma,Some results on fractional factors of graphs, Shandong University Doctoral Dissertation, 2002.

  7. Yinghong Ma and Guizhen Liu,Some results on fractional k-extendable graphs, J. Engin. Math.24(4) (2004), 567–573.

    MathSciNet  Google Scholar 

  8. T. Nishimura,On 1-factors and matching extension, Discrete Math.222 (2000), 285–290.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. D. Plummer and A. Saito,Closure and factor-critical graphs, Discrete Math.215 (2000), 171–179.

    Article  MATH  MathSciNet  Google Scholar 

  10. E. R. Scheinerman and D. H. Ullman,Fractional Graph Theory, New York, John Wiley and Sons, New York, 1997.

    MATH  Google Scholar 

  11. Qinglin Yu,Characterizations of various matchings in graphs, Austra. J. combin.7 (1993), 55–64.

    MATH  Google Scholar 

  12. Jiguo Yu and Guizhen Liu,Binding number and minimum degree conditions for graphs to have fractional factors, J. Shandong University39(3) (2004), 1–5.

    MATH  Google Scholar 

  13. Jiguo Yu and Guizhen Liu,Fractional k-factors of graphs, J. Engin. Math.22(2) (2005), 377–480.

    MATH  MathSciNet  Google Scholar 

  14. Jiguo Yu, Guizhen Liu, Meijie Ma and Baoxiang Cao,A degree condition for graphs to have fractional k-factors, Advances in Mathematics, to appear.

  15. Lanju Zhang and Guizhen Liu,Fractional k-factors of graphs, J. Sys. Sci. & Math. Scis.,21(1) (2001), 88–92.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of computer Science, Qufu Normal University, 276826, Rizhao, P. R. China

    Jiguo Yu & Na Wang

  2. School of Mathematics and Information science, Shandong University of Technology, 250100, Zibo, P. R. China

    Qiuju Bian

  3. School of Mathematics and Information science, Shandong University of Technology, 250100, Jinan, P. R. China

    Guizhen Liu

Authors
  1. Jiguo Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qiuju Bian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guizhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Na Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiguo Yu.

Additional information

The research is supported by NSFC(10471078), RSDP(20040422004), Promotional Foundation (2005BS01016) for Middle-aged or Young Scientists of Shandong Province and DRF of QFNU.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, J., Bian, Q., Liu, G. et al. Some results on fractionaln-factor-critical graphs. J. Appl. Math. Comput. 25, 283–291 (2007). https://doi.org/10.1007/BF02832353

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02832353

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation