%0 Journal Article
%T Tenacity and some related results
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Moazzami, Dara
%D 2017
%\ 06/01/2017
%V 49
%N 1
%P 83-91
%! Tenacity and some related results
%K vertex connectivity
%K toughness
%K binding number
%K independence number
%K edge-connectivity
%R 10.22059/jac.2017.7986
%X Conceptually graph vulnerability relates to the study of graphintactness when some of its elements are removed. The motivation forstudying vulnerability measures is derived from design and analysisof networks under hostile environment. Graph tenacity has been anactive area of research since the the concept was introduced in1992. The tenacity T(G) of a graph G is defined as\begin{center} $T(G)=\displaystyle \min_{A\subset V(G)}\{\frac{\mid A\mid +\tau(G-A)}{\omega(G-A)}\}$\end{center}where $\tau(G-A)$ denotes the order (the number of vertices) of alargest component of G-A and $\omega(G-A)$ is the number ofcomponents of G-A. In this paper we discuss tenacity and its properties invulnerability calculation.
%U https://jac.ut.ac.ir/article_7986_4ca995acf8ce801abe8eb3b4123a284c.pdf