TY - JOUR
ID - 7986
TI - Tenacity and some related results
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Moazzami, Dara
AD - University of Tehran, College of Engineering, Department of Engineerng Science
Y1 - 2017
PY - 2017
VL - 49
IS - 1
SP - 83
EP - 91
KW - vertex connectivity
KW - toughness
KW - binding number
KW - independence number
KW - edge-connectivity
DO - 10.22059/jac.2017.7986
N2 - 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.
UR - https://jac.ut.ac.ir/article_7986.html
L1 - https://jac.ut.ac.ir/article_7986_4ca995acf8ce801abe8eb3b4123a284c.pdf
ER -