Abstract :
In this paper we discuss about tenacity and its properties
in stability calculation. We indicate relationships
between tenacity and connectivity, tenacity and binding
number, tenacity and toughness. We also give good
lower and upper bounds for tenacity. Since we are primarily
interested in the case where disruption of the
graph is caused by the removal of a vertex or vertices
(and the resulting loss of all edges incident with the removed
vertices), we shall restrict our discussion to vertex
stability measures. In the interest of completeness, however,
we have included several related measures of edge
stability.
