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

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

 آمار

تعداد نشریات158
تعداد شماره‌ها6,230
تعداد مقالات67,757
تعداد مشاهده مقاله115,119,717
تعداد دریافت فایل اصل مقاله89,888,412
Moazzami, Dara. (1395). Towards a measure of vulnerability, tenacity of a Graph. , 48(1), 149-153. doi: 10.22059/jac.2016.7953
Dara Moazzami. "Towards a measure of vulnerability, tenacity of a Graph". , 48, 1, 1395, 149-153. doi: 10.22059/jac.2016.7953
Moazzami, Dara. (1395). 'Towards a measure of vulnerability, tenacity of a Graph', , 48(1), pp. 149-153. doi: 10.22059/jac.2016.7953
Moazzami, Dara. Towards a measure of vulnerability, tenacity of a Graph. , 1395; 48(1): 149-153. doi: 10.22059/jac.2016.7953

Towards a measure of vulnerability, tenacity of a Graph

Journal of Algorithms and Computation
مقاله 11، دوره 48، شماره 1، اسفند 2016، صفحه 149-153    اصل مقاله (235.57 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2016.7953
نویسنده
Dara Moazzami*
University of Tehran, College of Engineering, Department of Engineering Science
چکیده
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.
کلیدواژه‌ها
connectivity؛ integrity؛ toughness؛ binding number and tenacity
آمار
تعداد مشاهده مقاله: 1,368
تعداد دریافت فایل اصل مقاله: 1,119


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