سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات162
تعداد شماره‌ها6,693
تعداد مقالات72,239
تعداد مشاهده مقاله129,213,212
تعداد دریافت فایل اصل مقاله102,041,898
Moazzami, Dara. (1396). Tenacity and some related results. , 49(1), 83-91. doi: 10.22059/jac.2017.7986
Dara Moazzami. "Tenacity and some related results". , 49, 1, 1396, 83-91. doi: 10.22059/jac.2017.7986
Moazzami, Dara. (1396). 'Tenacity and some related results', , 49(1), pp. 83-91. doi: 10.22059/jac.2017.7986
Moazzami, Dara. Tenacity and some related results. , 1396; 49(1): 83-91. doi: 10.22059/jac.2017.7986

Tenacity and some related results

Journal of Algorithms and Computation
مقاله 8، دوره 49، شماره 1، شهریور 2017، صفحه 83-91    اصل مقاله (269.52 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2017.7986
نویسنده
Dara Moazzami*
University of Tehran, College of Engineering, Department of Engineerng Science
چکیده
Conceptually graph vulnerability relates to the study of graph
intactness when some of its elements are removed. The motivation for
studying vulnerability measures is derived from design and analysis
of networks under hostile environment. Graph tenacity has been an
active area of research since the the concept was introduced in
1992.
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 a
largest component of G-A and $\omega(G-A)$ is the number of
components of G-A.
In this paper we discuss tenacity and its properties in
vulnerability calculation.
کلیدواژه‌ها
vertex connectivity؛ toughness؛ binding number؛ independence number؛ edge-connectivity
آمار
تعداد مشاهده مقاله: 332
تعداد دریافت فایل اصل مقاله: 364





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب