Abstract
A graph G is called a fractional (g, f)-covered graph if for any e ∈ E(G), G admits a fractional (g, f)-factor covering e. A graph G is called a fractional (g, f, n)-critical covered graph if for any S ⊆ V(G) with ∣S∣ = n, G − S is a fractional (g, f)-covered graph. A fractional (g, f, n)-critical covered graph is said to be a fractional (a, b, n)-critical covered graph if g(x) = a and f(x) = b for every x ∈ V(G). A fractional (a, b, n)-critical covered graph was first defined and studied in [1]. In this article, we investigate fractional (g, f, n)-critical covered graphs and present a binding number condition for the existence of fractional (g, f, n)-critical covered graphs, which is an improvement and generalization of a previous result obtained in [2].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Zhou, S., Xu, Y., and Sun, Z., Degree Conditions for Fractional (a,b,k)-Critical Covered Graphs, Inform. Process. Lett., 2019, vol. 152, Article 105838 (5 pp.).
Yuan, Y. and Hao, R.-X., Neighborhood Union Conditions for Fractional [a, b]-Covered Graphs, Bull. Malays. Math. Sci. Soc., 2020, vol. 43, no. 1, pp. 157–167.
Liu, G. and Zhang, L., Characterizations of Maximum Fractional (g, f)-Factors of Graphs, Discrete Appl. Math., 2008, vol. 156, no. 12, pp. 2293–2299.
Belck, H.-B., Reguläre Faktoren von Graphen, J. Reine Angew. Math., 1950, vol. 188, pp. 228–252.
Enomoto, H., Jackson, B., Katerinis, P., and Satio, A., Toughness and the Existence of k-Factors, J. Graph Theory, 1957, vol. 9, no. 1, pp. 87–95.
Katerinis, P. and Woodall, D.R., Binding Numbers of Graphs and the Existence of k-Factors, Quart. J. Math. Oxford Ser. (2), 1987, vol. 38, no. 150, pp. 221–228.
Plummer, M.D. and Saito, A., Toughness, Binding Number and Restricted Matching Extension in a Graph, Discrete Math., 2017, vol. 340, no. 11, pp. 2665–2672.
Kano, M. and Tokushige, N., Binding Numbers and f-Factors of Graphs, J. Combin. Theory Ser. B, 1992, vol. 54, no. 2, pp. 213–221.
Cymer, R. and Kano, M., Generalizations of Marriage Theorem for Degree Factors, Graphs Combin., 2016, vol. 32, no. 6, pp. 2315–2322 (2016).
Lovász, L., Subgraphs with Prescribed Valencies, J. Combin. Theory, 1970, vol. 8, pp. 391–416.
Egawa, Y. and Kano, M., Sufficient Conditions for Graphs to Have (g, f)-Factors, Discrete Math., 1996, vol. 151, no. 1–3, pp. 87–90.
Matsuda, H., A Neighborhood Condition for Graphs to Have [a, b]-Factors, Discrete Math., vol. 224, no. 1–3, pp. 289–292.
Kouider, M. and Ouatiki, S., Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph, Graphs Combin., 2013, vol. 29, no. 4, pp. 1051–1057.
Zhou, S., Zhang, T., and Xu, Z., Subgraphs with Orthogonal Factorizations in Graphs, Discrete Appl. Math., vol. 286, pp. 29–34.
Zhou, S. and Sun, Z., Binding Number Conditions for P≥2-Factor and P≥3-Factor Uniform Graphs, Discrete Math., 2020, vol. 343, no. 3, Article 111715 (6 pp.).
Zhou, S.Z. and Sun, Z.R., Some Existence Theorems on Path Factors with Given Properties in Graphs, Acta Math. Sin. (Engl. Ser.), 2020, vol. 36, no. 8, pp. 917–928.
Liu, G.Z., On (g, f)-Covered Graphs, Acta Math. Sci. (English Ed.), 1988, vol. 8, no. 2, pp. 181–184.
Anstee, R.P., An Algorithmic Proof of Tutte’s f-Factor Theorem, J. Algorithms, 1985, vol. 6, no. 1, pp. 112–131.
Liu, G. and Zhang, L., Toughness and the Existence of Fractional k-Factors of Graphs, Discrete Math., 2008, vol. 308, no. 9, pp. 1741–1748.
Katerinis, P., Fractional ℓ-Factors in Regular Graphs, Australas. J. Combin., 2019, vol. 73, Part 3, pp. 432–439.
Zhou, S., Sun, Z., and Ye, H., A Toughness Condition for Fractional (k, m)-Deleted Graphs, Inform. Process. Lett., 2013, vol. 113, no. 8, pp. 255–259.
Gao, W., Wang, W.F. and Guirao, J.L.G., The Extension Degree Conditions for Fractional Factor, Acta Math. Sin. (Engl. Ser.), 2020, vol. 36, no. 3, pp. 305–317.
Zhou, S., Xu, L., and Xu, Z., Remarks on Fractional ID-k-Factor-Critical Graphs, Acta Math. Appl. Sin. Engl. Ser., 2019, vol. 35, no. 2, pp. 458–464.
Yuan, Y. and Hao, R.-X., Toughness Condition for the Existence of All Fractional (a, b, k)-Critical Graphs, Discrete Math., 2019, vol. 342, no. 8, pp. 2308–2314.
Lu, H. and Yu, Q., General Fractional f-Factor Numbers of Graphs, Appl. Math. Lett., 2011, vol. 24, no. 4, pp. 519–523.
Li, Z., Yan, G., and Zhang, X., On Fractional (g, f)-Covered Graphs, OR Trans. (in Chinese), 2002, vol. 6, no. 4, pp. 65–68.
Zhou, S., Wu, J., and Liu, H., Independence Number and Connectivity for Fractional (a, b, k)-Critical Covered Graphs, arXiv:1909.01070[math.CO], 2019.
Lv, X., A Degree Condition for Fractional (g, f, n)-Critical Covered Graphs, AIMS Math., 2020, vol. 5, no. 2, pp. 872–878.
Zhou, S., Remarks on Orthogonal Factorizations of Digraphs, Int. J. Comput. Math., 2014, vol. 91, no. 10, pp. 2109–2117.
Zhou, S., Sun, Z., and Xu, Z., A Result on r-Orthogonal Factorizations in Digraphs, European J. Combin., 2017, vol. 65, pp. 15–23.
Zhou, S., Sun, Z., and Liu, H., Sun Toughness and P≥3-Factors in Graphs, Contrib. Discrete Math., 2019, vol. 14, no. 1, pp. 167–174.
Zhou, S., Yang, F., and Xu, L., Two Sufficient Conditions for the Existence of Path Factors in Graphs, Sci. Iran. D: Comput. Sci. Eng. Electr. Eng., 2019, vol. 26, no. 6, pp. 3510–3514.
Zhou, S., Remarks on Path Factors in Graphs, RAIRO—Oper. Res., 2020, vol. 54, no. 6, pp. 1827–1834.
Acknowledgements
We would like to thank anonymous referees for their valuable comments and helpful suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, S., Zhang, W. Research on Fractional Critical Covered Graphs. Probl Inf Transm 56, 270–277 (2020). https://doi.org/10.1134/S0032946020030047
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946020030047