Abstract
A graph [Formula: see text] is a fractional [Formula: see text]-deleted graph if deleting any [Formula: see text] edges from [Formula: see text], the resulting subgraph still admits a fractional [Formula: see text]-factor. As an exclusive graph-based parameter, isolated toughness and its variant are utilized to measure the vulnerability of networks which are modelled by graph topology structures. Early studies have shown the inherent connection between isolated toughness and the existence of fractional factors in specific settings. This paper provides a theoretical perspective on the sufficient conditions for fractional [Formula: see text]-deleted graphs with respect to isolated toughness and its variant. The sharpness of the given isolated toughness bounds is explained by counterexamples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Geometric Methods in Modern Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
