Abstract
A graph G is minimally t-tough if the toughness of G is t and deletion of any edge from G decreases its toughness. Katona et al. conjectured that the minimum degree of any minimally t-tough graph is ⌈2t⌉ and gave some upper bounds on the minimum degree of the minimally t-tough graphs in [5,6]. In this paper, we show that a minimally 1-tough graph G with girth g≥5 has minimum degree at most ⌊ng+1⌋+g−1, and a minimally 1-tough graph with girth 4 has minimum degree at most n+64. We also prove that the minimum degree of minimally 32-tough, claw-free graphs is 3.
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.
