Skip to main content
Log in

Neighborhood union conditions for fractional [ab]-covered graphs

  • Published:
Bulletin of the Malaysian Mathematical Sciences Society Aims and scope Submit manuscript

Abstract

Let G be a graph of order n. The binding number \(\text{ bind }(G)\) of G is \(\min \{\frac{|N_{G}(X)|}{|X|}\mid \emptyset \ne X\subseteq V(G)\,\, \text{ and }\,\, N_{G}(X)\ne V(G)\}\). Throughout this article, some sufficient conditions about neighborhood union and \(\text{ bind }(G)\) for a graph G to be fractional covered are obtained. Moreover, some graphs to verify that the results are best possible in a certain sense are gotten.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)

    Book  Google Scholar 

  2. Furuya, M., Yashima, T.: Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle. Discrete Math. 340, 1419–1425 (2017)

    Article  MathSciNet  Google Scholar 

  3. Kouider, M., Ouatiki, S.: Sufficient condition for the existence of an even \([a, b]\)-factor in graph. Graphs Combin. 29, 1051–1057 (2013)

    Article  MathSciNet  Google Scholar 

  4. Li, Y.J., Cai, M.C.: A degree condition for a graph to have \([a, b]\)-factors. J. Graph Theory 27, 1–6 (1998)

    Article  MathSciNet  Google Scholar 

  5. Li, Z.P., Yan, G.Y., Zhang, X.S.: On fractional \((g, f)\)-covered graphs. OR Trans. 6, 65–68 (2002)

    Google Scholar 

  6. Liu, G.Z.: On \((g, f)\)-covered graphs. Acta. Math. Scientia. 8, 181–184 (1988)

    Article  MathSciNet  Google Scholar 

  7. Liu, H.D., Lu, H.L.: A degree condition for a graph to have \((a, b)\)-parity factors. Discrete Math. 341, 244–252 (2018)

    Article  MathSciNet  Google Scholar 

  8. Matsuda, H.: A neighborhood condition for graphs to have \([a, b]\)-factors. Discrete Math. 224, 289–292 (2000)

    Article  MathSciNet  Google Scholar 

  9. Zhou, S.Z.: Degree conditions for graphs to be fractional \(k\)-covered graphs. Ars Comb. 118, 135–142 (2015)

    MathSciNet  MATH  Google Scholar 

  10. Zhou, S.Z.: Remarks on orthogonal factorizations of digraphs. Int. J. Comput. Math. 91(10), 2109–2117 (2014)

    Article  MathSciNet  Google Scholar 

  11. Zhou, S.Z., Liu, H.X.: Neighborhood conditions and fractional \(k\)-factors. Bull. Malays. Math. Sci. Soc. 32, 37–45 (2009)

    MathSciNet  MATH  Google Scholar 

  12. Zhou, S.Z., Sun, Z.R., Xu, Z.R.: A result on \(r\)-orthogonal factorizations in digraphs. Eur. J. Combin. 65, 15–23 (2017)

    Article  MathSciNet  Google Scholar 

  13. Zhou, S.Z., Zhang, T.: Some existence theorems on all fractional \((g, f)\)-factors with prescribed properties. Acta Math. Appl. Sin., Engl. Ser. 34(2), 344–350 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (No. 11731002), the Fundamental Research Funds for the Central Universities (Nos. 2016JBZ012, 2016JBM071) and the 111 Project of China (B16002).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rong-Xia Hao.

Additional information

Communicated by Xueliang Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yuan, Y., Hao, RX. Neighborhood union conditions for fractional [ab]-covered graphs. Bull. Malays. Math. Sci. Soc. 43, 157–167 (2020). https://doi.org/10.1007/s40840-018-0669-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40840-018-0669-y

Keywords

Mathematics Subject Classification

Navigation