پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,225 |
| تعداد مقالات | 67,685 |
| تعداد مشاهده مقاله | 114,987,654 |
| تعداد دریافت فایل اصل مقاله | 89,658,144 |
On the J-Tightness of Graphs | ||
| Journal of Algorithms and Computation | ||
| دوره 53، شماره 2، اسفند 2021، صفحه 57-74 اصل مقاله (370.32 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2021.85198 | ||
| نویسندگان | ||
| Abolfazl Javan1؛ Majid Javan2؛ M. Jafarpour1؛ Dara Moazzami3؛ Ali Moieni* 1 | ||
| 1Department of Algorithms and Computation, School of Engineering Science, College of Engineering, University of Tehran | ||
| 2Department of Computer Science, Faculty of Science, University of Tehran | ||
| 3Department of Algorithms and Computation, Faculty of Engineering Science, School of Engineering, University of Tehran, Iran, and Department of Mathematics, UCLA, California, USA | ||
| چکیده | ||
| We introduce a new invariant vulnerability parameter named “J-Tightness” or “J(G)” for graphs. As a stability measure, its properties along with comparisons to other parameters of a graph are proposed. We show how it is calculated for complete graphs and cycles. We show that J-Tightness better fits the properties of vulnerability measures and can be used with more confidence to assess the vulnerability of any classes of graphs. | ||
| کلیدواژه‌ها | ||
| Network Vulnerability؛ Connectivity؛ Binding Number؛ Scattering Number؛ Rapture Degree؛ Integrity؛ Toughness؛ Tenacity؛ J-Tightness | ||
|
آمار تعداد مشاهده مقاله: 290 تعداد دریافت فایل اصل مقاله: 178 |
||