×
Wu, Jianzhang; Yuan, Jiabin; Baskonus, Haci Mehmet; Gao, Wei

Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor. (English) Zbl 1516.05204

J. Funct. Spaces 2023, Article ID 9932025, 16 p. (2023).

MSC:

05C82 Small world graphs, complex networks (graph-theoretic aspects)

Keywords:

network graphs; factor-deleted graph
Cite Review PDF
Full Text: DOI
OA License

References:

[1] Bondy, J. A.; Mutry, U. S. R., Graph Theory (2008), Berlin: Springer, Berlin · Zbl 1134.05001 · doi:10.1007/978-1-84628-970-5
[2] Akiyama, J.; Avis, D.; Era, H., On a {1,2}-factor of a graph, TRU Mathematics, 16, 97-102 (1980) · Zbl 0461.05047
[3] Gao, W.; Wang, W.; Dimitrov, D., Toughness condition for a graph to be all fractional (g,f,n)-critical deleted, Univerzitet u Nišu, 33, 9, 2735-2746 (2019) · Zbl 1499.05516 · doi:10.2298/FIL1909735G
[4] Gao, W.; Wang, W.; Guirao, J. L. G., The extension degree conditions for fractional factor, Acta Mathematica Sinica, English Series, 36, 3, 305-317 (2020) · Zbl 1442.05176 · doi:10.1007/s10114-020-9156-0
[5] Wang, S.; Zhang, W., Isolated toughness for path factors in networks, RAIRO-Operations Research, 56, 4, 2613-2619 (2022) · Zbl 1497.05223 · doi:10.1051/ro/2022123
[6] Zhou, S.; Wu, J.; Bian, Q., On path-factor critical deleted (or covered) graphs, Aequationes Mathematicae, 96, 4, 795-802 (2022) · Zbl 1520.05081 · doi:10.1007/s00010-021-00852-4
[7] Zhou, S.; Wu, J.; Xu, Y., Toughness, isolated toughness and path factors in graphs, Bulletin of the Australian Mathematical Society, 106, 2, 195-202 (2022) · Zbl 1497.05227 · doi:10.1017/S0004972721000952
[8] Zhou, S.; Sun, Z.; Bian, Q., Isolated toughness and path-factor uniform graphs (II), Indian Journal of Pure and Applied Mathematics, 55, 3, 1279-1290 (2021) · Zbl 1468.05243 · doi:10.1007/s13226-022-00286-x
[9] Zhou, S., Path factors and neighborhoods of independent sets in graphs, Acta Mathematicae Applicatae Sinica-English Series (2022) · Zbl 1512.05343 · doi:10.1007/s10255-022-1096-2
[10] Zhou, S.; Sun, Z.; Liu, H., On P(≥3)-factor deleted graphs, Acta Mathematicae Applicatae Sinica-English Series, 38, 1, 178-186 (2022) · Zbl 1484.05172
[11] Zhu, L.; Hua, G., Theoretical perspective of multi-dividing ontology learning trick in two-sample setting, IEEE Access, 8, 220703-220709 (2020) · doi:10.1109/ACCESS.2020.3041659
[12] Zhu, L.; Hua, G.; Zafar, S.; Pan, Y., Fundamental ideas and mathematical basis of ontology learning algorithm, Journal of Intelligent and Fuzzy Systems, 35, 4, 4503-4516 (2018) · doi:10.3233/JIFS-169769
[13] Kaneko, A., A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two, Journal of Combinatorial Theory, Series B, 88, 2, 195-218 (2003) · Zbl 1029.05125 · doi:10.1016/S0095-8956(03)00027-3
[14] Kano, M.; Katona, G. Y.; Király, Z., Packing paths of length at least two, Discrete Mathematics, 283, 1-3, 129-135 (2004) · Zbl 1042.05084 · doi:10.1016/j.disc.2004.01.016
[15] Zhang, H.; Zhou, S., Characterizations for P≥2-factor and P≥3-factor covered graphs, Discrete Mathematics, 309, 8, 2067-2076 (2009) · Zbl 1205.05187 · doi:10.1016/j.disc.2008.04.022
[16] Chvátal, V., Tough graphs and Hamiltonian circuits, Discrete Mathematics, 5, 3, 215-228 (1973) · Zbl 0256.05122 · doi:10.1016/0012-365X(73)90138-6
[17] Enomoto, H.; Jackson, B.; Katerinis, P.; Saito, A., Toughness and the existence of k-factors, Journal of Graph Theory, 9, 1, 87-95 (1985) · Zbl 0598.05054 · doi:10.1002/jgt.3190090106
[18] Yang, J.; Ma, Y.; Liu, G., Fractional (g,f)-factors in graphs, Applied Mathematics-A Journal of Chinese Universities, Series A, 16, 385-390 (2001) · Zbl 0991.05087 · doi:10.1016/S0252-9602(17)30443-5
[19] Zhang, L.; Liu, G., Fractional k-factor of graphs, Journal of Systems Science and Mathematical Sciences, 21, 1, 88-92 (2001) · Zbl 0985.05039
[20] Woodall, D., The binding number of a graph and its Anderson number, Journal of Combinatorial Theory, Series B, 15, 3, 225-255 (1973) · Zbl 0253.05139 · doi:10.1016/0095-8956(73)90038-5
[21] Zhou, S.; Wu, J.; Zhang, T., The existence of P(≥3)-factor covered graphs,, Discussiones Mathematicae Graph Theory, 37, 1055-1065 (2017) · Zbl 1372.05178 · doi:10.7151/dmgt.1974
[22] Gao, W.; Wang, W.; Chen, Y., Tight bounds for the existence of path factors in network vulnerability parameter settings, International Journal of Intelligent Systems, 36, 3, 1133-1158 (2021) · doi:10.1002/int.22335
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.