Have a personal or library account? Click to login
Two sufficient conditions for fractional k-deleted graphs Cover

Two sufficient conditions for fractional k-deleted graphs

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Volume 20 (2012): Issue 1 (May 2012)
By:
Open Access
|May 2013

References

  1. [1] J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, London, The Macmillan Press, 1976.10.1007/978-1-349-03521-2
    Search in Google Scholar
  2. [2] J. Cai, G. Liu, Stability number and fractional f-factors in graphs, Ars Combinatoria 80(2006), 141-146.
    Search in Google Scholar
  3. [3] K. Kotani, Binding numbers of fractional k-deleted graphs, Proceedings of the Japan Academy, Ser. A, Mathematical Sciences 86(2010), 85-88.
    Search in Google Scholar
  4. [4] Z. Li, G. Yan, X. Zhang, On fractional (g; f)-deleted graphs, Mathematica Applicata (Wuhan) 16(2003), 148-154.
    Search in Google Scholar
  5. [5] G. Liu, L. Zhang, Toughness and the existence of fractional k-factors of graphs, Discrete Mathematics 308(2008), 1741-1748. 10.1016/j.disc.2006.09.048
    Search in Google Scholar
  6. [6] T. Niessen, Nash-Williams conditions and the existence of k-factors, Ars Combinatoria 34(1992), 251-256.
    Search in Google Scholar
  7. [7] T. Nishimura, A degree condition for the existence of k-factors, Journal of Graph Theory 16(1992), 141-151.10.1002/jgt.3190160205
    Search in Google Scholar
  8. [8] J. Yu, G. Liu, M. Ma, B. Cao, A degree condition for graphs to have fractional factors, Advances in Mathematics (China) 35(2006), 621-628.
    Search in Google Scholar
  9. [9] S. Zhou, A minimum degree condition of fractional (k;m)-deleted graphs, Comptes rendus Mathematique 347(2009), 1223-1226.10.1016/j.crma.2009.09.022
    Search in Google Scholar
  10. [10] S. Zhou, A result on fractional k-deleted graphs, Mathematica Scandinavica 106(2010), 99-106.10.7146/math.scand.a-15127
    Search in Google Scholar
  11. [11] S. Zhou, A sufficient condition for a graph to be an (a; b; k)-critical graph, International Journal of Computer Mathematics 87(2010), 2202-2211.10.1080/00207160902777914
    Search in Google Scholar
  12. [12] S. Zhou, Independence number, connectivity and (a; b; k)-critical graphs, Discrete Mathematics 309(2009), 4144-4148.10.1016/j.disc.2008.12.013
    Search in Google Scholar
  13. [13] S. Zhou, Some new sufficient conditions for graphs to have fractional k- factors, International Journal of Computer Mathematics 88(2011), 484-490. 10.1080/00207161003681286
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10309-012-0017-4 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Journal RSS Feed
Language: English
Page range: 265 - 274
Published on: May 17, 2013
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 times per year
Keywords:
operations research,
independence number,
minimum degree,
fractional k-factor,
fractional k-deleted graph
Related subjects:
Mathematics,
General mathematics

© 2013 Xiangyang Lv, published by Ovidius University of Constanta
This work is licensed under the Creative Commons License.

Previous articleVolume 20 (2012): Issue 1 (May 2012)Next article