Abstract
The [Formula: see text]-factor and [Formula: see text]-factor of a graph are a spanning subgraph whose each component is an element of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is a special family of trees. In this paper, we obtain a sufficient condition in terms of tight toughness, isolated toughness and binding number bounds to guarantee the existence of a [Formula: see text]-factor and [Formula: see text]-factor for any graph.
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 callDisclaimer: 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.
