Wiener index and vulnerability parameters of graphs

DOI10.1016/j.dam.2023.05.020zbMath1519.05056OpenAlexW4380304499MaRDI QIDQ6166041

M. Yatauro

Publication date: 2 August 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.05.020

zbMATH Keywords

tenacityWiener indextoughnessintegritybinding number

Mathematics Subject Classification ID

Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Best monotone degree conditions for binding number
• On the complexity of recognizing tough graphs
• Computing the binding number of a graph
• Wiener index, Harary index and graph properties
• Toughness and binding number
• Tough graphs and Hamiltonian circuits.
• WIENER INDEX ON TRACEABLE AND HAMILTONIAN GRAPHS
• Toughness and the existence ofk-factors
• Toughness and Vertex Degrees
• The binding number of a graph and its Anderson number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Wiener index and vulnerability parameters of graphs