If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. In assessing the "vulnerability" of a graph one determines the extent to which the graph retains certain properties after the removal of vertices and / or edges. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number, tenacity and... . In this paper we survey and discuss tenacity and its properties in vulnerability calculation and we will compare different measures of vulnerability with tenacity for several classes of graphs.
Khoshnood, A. & Moazzami, D. (2021). A Survey on Tenacity Parameter\\Part I. Journal of Algorithms and Computation, 53(1), 181-196. https://doi.org/10.22059/jac.2021.81721
MLA
Khoshnood, A., & Moazzami, D. "A Survey on Tenacity Parameter\\Part I", Journal of Algorithms and Computation, 53, 1, 2021, 181-196. doi: 10.22059/jac.2021.81721
HARVARD
Khoshnood A., Moazzami D. (2021). 'A Survey on Tenacity Parameter\\Part I', Journal of Algorithms and Computation, 53(1), pp. 181-196. doi: 10.22059/jac.2021.81721
CHICAGO
A. Khoshnood & D. Moazzami, "A Survey on Tenacity Parameter\\Part I," Journal of Algorithms and Computation, 53 1 (2021): 181-196, doi: 10.22059/jac.2021.81721
VANCOUVER
Khoshnood A., Moazzami D. A Survey on Tenacity Parameter\\Part I. J. Algo. Comp. 2021;53(1):181-196. doi: 10.22059/jac.2021.81721
