پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 162 |
| تعداد شماره‌ها | 6,693 |
| تعداد مقالات | 72,239 |
| تعداد مشاهده مقاله | 129,222,564 |
| تعداد دریافت فایل اصل مقاله | 102,052,534 |
Edge-tenacity in Networks | ||
| Journal of Algorithms and Computation | ||
| مقاله 6، دوره 49، شماره 1، شهریور 2017، صفحه 45-53 اصل مقاله (244.57 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2017.7980 | ||
| نویسنده | ||
| Dara Moazzami* | ||
| University of Tehran, College of Engineering, Department of Engineering Science | ||
| چکیده | ||
| Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the "Tenacity" and "Edge-tenacity" of a graph. In this paper we present results on the tenacity and edge-tenacity, $T_e(G)$, a new invariant, for several classes of graphs. Basic properties and some bounds for edge-tenacity, $T_e(G)$, are developed. Edge-tenacity values for various classes of graphs are calculated and future work andconcluding remarks are summarized | ||
| کلیدواژه‌ها | ||
| Edge-tenacity؛ network vulnerability | ||
|
آمار تعداد مشاهده مقاله: 415 تعداد دریافت فایل اصل مقاله: 304 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب