Abstract
Let G be a graph, and g, f: V (G) → Z+ with g(x) ≤ f(x) for each x ∈ V (G). We say that G admits all fractional (g, f)-factors if G contains an fractional r-factor for every r: V (G) → Z+ with g(x) ≤ r(x) ≤ f(x) for any x ∈ V (G). Let H be a subgraph of G. We say that G has all fractional (g, f)-factors excluding H if for every r: V (G) → Z+ with g(x) ≤ r(x) ≤ f(x) for all x ∈ V (G), G has a fractional r-factor F h such that E(H) ∩ E(F h ) = θ, where h: E(G) → [0, 1] is a function. In this paper, we show a characterization for the existence of all fractional (g, f)-factors excluding H and obtain two sufficient conditions for a graph to have all fractional (g, f)-factors excluding H.
Similar content being viewed by others
References
Anstee, R. P. Simplified existence theorems for (g, f)-factors. Discrete Applied Mathematics, 27: 29–38 (1990)
Diemunsch, J., Ferrara, M., Graffeo, S., Morris, T. On 2-factors with a bounded number of odd components. Discrete Mathematics, 323: 35–42 (2014)
Enomoto, H., Tokuda, T. Complete-factors and f-factors. Discrete Mathematics, 220: 239–242 (2000)
Gu, X. Regular factors and eigenvalues of regular graphs. European Journal of Combinatorics, 42: 15–25 (2014)
Gao, W., Liang, L., Xu, T., Zhou, J. Tight toughness condition for fractional (g, f, n)-critical graphs. Journal of the Korean Mathematical Society, 51: 55–65 (2014)
Kotani, K. Binding numbers of fractional k-deleted graphs. Proceedings of the Japan Academy, Series A, Mathematical Sciences, 86: 85–88 (2010)
Kouider, M., Ouatiki, S. Sufficient condition for the existence of an even [a, b]-factor in graph. Graphs and Combinatorics, 29: 1051–1057 (2013)
Liu, G., Zhang, L. Fractional (g, f)-factors of graphs. Acta Mathematica Scientia Series B, 21: 541–545 (2001)
Lovász, L. Subgraphs with prescribed valencies. Journal of Combinatorial Theory, 8: 391–416 (1970)
Lu, H. Simplified existence theorems on all fractional [a, b]-factors. Discrete Applied Mathematics, 161: 2075–2078 (2013)
Niessen, T. A characterization of graphs having all (g, f)-factors. Journal of Combinatorial Theory Series B, 72: 152–156 (1998)
Yang, J., Ma, Y., Liu, G. Fractional (g, f)-factors in graphs. Applied Mathematics A Journal of Chinese Universities (Series A), 16(4): 385–390 (2001)
Zhou, S. A new neighborhood condition for graphs to be fractional (k,m)-deleted graphs. Applied Mathematics Letters, 25: 509–513 (2012)
Zhou, S. A sufficient condition for a graph to be an (a, b, k)-critical graph. International Journal of Computer Mathematics, 87: 2202–2211 (2010)
Zhou, S. Independence number, connectivity and (a, b, k)-critical graphs. Discrete Mathematics, 309: 4144–4148 (2009)
Zhou, S. Remarks on orthogonal factorizations of digraphs. International Journal of Computer Mathematics, 91(10): 2109–2117 (2014)
Zhou, S. Some results about component factors in graphs. RAIRO-Operations Research, Doi: 10.1051/ro/2017045.
Zhou, S., Sun, Z. On all fractional (a, b, k)-critical graphs. Acta Mathematica Sinica, English Series, 30: 696–702 (2014)
Zhou, S., Yang, F., Sun, Z. A neighborhood condition for fractional ID-[a, b]-factor-critical graphs. Discussiones Mathematicae Graph Theory, 36(2): 409–418 (2016)
Acknowledgements
The authors would like to thank the anonymous referees for their kind help and valuable suggestions which led to an improvement of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China (Grant No. 11371009, 11501256, 61503160), and is sponsored by Six Big Talent Peak of Jiangsu Province (Grant No. JY–022) and 333 Project of Jiangsu Province.
Rights and permissions
About this article
Cite this article
Zhou, Sz., Zhang, T. Some Existence Theorems on All Fractional (g, f)-factors with Prescribed Properties. Acta Math. Appl. Sin. Engl. Ser. 34, 344–350 (2018). https://doi.org/10.1007/s10255-018-0753-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-018-0753-y