Abstract
Among several parameters in computer networks to measure its vulnerability, toughness is the most important one which has raised widespread concern from mathematicians and computer scientists. Starting from the requirements of network security, other toughness related parameters are successively defined and applied to related engineering fields. Very recently, Zhou et al. [1] defined a new parameter called “sun toughness” and also show the essential connection with path factors. We first introduce a new variant related on sun toughness, and then we give the bounds of this variant to ensure a graph has path factor in different settings in this paper. Furthermore, we show that the sun toughness bounds are sharp in some sense.
Supported by Modern Education Technology Research Project in Jiangsu Province (No. 2019-R-75637) and horizontal foundation “Design of equipment access system based on 3D printing cloud service platform” (No. 2019530101000686).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Zhou, S., Sun, Z., Liu, H.: Sun touthness and \(P_{\ge 3}\)-factors in graphs. Contrib. Disc. Math. 14(1), 167–174 (2019)
Chvátal, V.: Tough graphs and Hamiltonian circuits. Disc. Math. 5, 215–228 (1973)
Yang, J.B., Ma, Y.H., Liu, G.Z.: Fractional \((g, f)\)-factors in graphs. Appl. Math.- J. Chin. Univ. Ser. A 16, 385–390 (2001)
Enomoto, H., Jackson, B., Katerinis, P., Saito, A.: Toughness and the existence of \(k\)-factors. J. Graph Theory 9, 87–95 (1985)
Enomoto, H.: Toughness and the existence of \(k\)-factors II. Disc. Math. 189, 277–282 (1998)
Zhang, L., Liu, G.: Fractional \(k\)-factor of graphs. J. Syst. Sci. Math. Sci. 21(1), 88–92 (2001)
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. J. Comb. Theory Ser. B 88(2), 195–218 (2003)
Zhang, H., Zhou, S.: Characterizations for \(P_{\ge 2}\)-factor and \(P_{\ge 3}\)-factor covered graphs. Disc. Math. 309, 2067–2076 (2009)
Gao, W., Wang, W., Dimitrov, D.: Toughness condition for a graph to be all fractional \((g, f, n)\)-critical deleted. Filomat 33(9), 2735–2746 (2019)
Gao, W., Guirao, J.L.G., Chen, Y.: A toughness condition for fractional \((k, m)\)-deleted graphs revisited. Acta Math. Sinica Engl. Ser. 35(7), 1227–1237 (2019)
Gao, W., Guirao, J.L.G.: Parameters and fractional factors in different settings. J. Inequalities Appl. 2019(1), 1–16 (2019). https://doi.org/10.1186/s13660-019-2106-7
Gao, W., Guirao, J.L.G., Abdel-Aty, M., Xi, W.: An independent set degree condition for fractional critical deleted graphs. Disc. Continuous Dyn. Syst.-Ser. S 12(4–5), 877–886 (2019)
Gao, W., Guirao, J.L.G., Wu, H.: Two tight independent set conditions for fractional \((g, f, m)\)-deleted graphs systems. Qual. Theory Dyn. Syst. 17(1), 231–243 (2018)
Acknowledgments
We thank the reviewers for their constructive comments in improving the quality of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhu, L., Baskonus, H.M., Gao, W. (2020). A Variant of Sun Toughness and the Existence of Path Factors in Networks. In: Chen, X., Yan, H., Yan, Q., Zhang, X. (eds) Machine Learning for Cyber Security. ML4CS 2020. Lecture Notes in Computer Science(), vol 12487. Springer, Cham. https://doi.org/10.1007/978-3-030-62460-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-62460-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62459-0
Online ISBN: 978-3-030-62460-6
eBook Packages: Computer ScienceComputer Science (R0)