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. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity. In this paper we discuss tenacity and its properties in vulnerability calculation.
Moazzami, D. (2016). Towards a measure of vulnerability, tenacity of a Graph. Journal of Algorithms and Computation, 48(1), 149-153. doi: 10.22059/jac.2016.7953
MLA
Dara Moazzami. "Towards a measure of vulnerability, tenacity of a Graph". Journal of Algorithms and Computation, 48, 1, 2016, 149-153. doi: 10.22059/jac.2016.7953
HARVARD
Moazzami, D. (2016). 'Towards a measure of vulnerability, tenacity of a Graph', Journal of Algorithms and Computation, 48(1), pp. 149-153. doi: 10.22059/jac.2016.7953
VANCOUVER
Moazzami, D. Towards a measure of vulnerability, tenacity of a Graph. Journal of Algorithms and Computation, 2016; 48(1): 149-153. doi: 10.22059/jac.2016.7953
)