Abstract
In recent years, the relationship between network graph parameters and the existence of specific H-factor has attracted the attention of researchers. The latest research has found that for factor deleted graphs and factor critical graphs, the tight bounds of graph parameters are changing as the low bound of connectivity changes. This work studies the existence of {K1,1,K1,2,Ct}-factor from high-dimensional space perspective. Several surfaces reveal that the dynamic changing of tight parameter (toughness, isolated toughness, sun toughness, binding number) bounds are defined. The precise expression of these surfaces are presented.
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 Cognitive Computing in Engineering
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.
