Some sufficient conditions for graphs to be <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e38" altimg="si22.svg"><mml:mi>k</mml:mi></mml:math>-leaf-connected

Liu, Hechao; You, Lihua; Hua, Hongbo; Du, Zenan

doi:10.1016/j.dam.2024.03.017

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Some sufficient conditions for graphs to be k-leaf-connected

Cited by 4 publications

References 32 publications

On sufficient condition for t-toughness of a graph in terms of eccentricity-based indices

On sufficient condition for t-toughness of a graph in terms of eccentricity-based indices

Sufficient conditions for hamiltonian properties of graphs based on the difference of Zagreb indices

Some results on vulnerability parameters and Wiener-type indices

Contact Info

Product

Resources

About