![سامانه نشر مجلات علمی دانشگاه تهران](./data/logo.png)
تعداد نشریات | 162 |
تعداد شمارهها | 6,578 |
تعداد مقالات | 71,072 |
تعداد مشاهده مقاله | 125,684,587 |
تعداد دریافت فایل اصل مقاله | 98,914,010 |
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,420 تعداد دریافت فایل اصل مقاله: 1,186 |