TY - JOUR ID - 85486 TI - On the J-Tightness of Graphs JO - Journal of Algorithms and Computation JA - JAC LA - en SN - 2476-2776 Y1 - 2022 PY - 2022 VL - IS - SP - 1 EP - 18 KW - network vulnerability KW - connectivity KW - binding number KW - Scattering Number KW - Rapture Degree KW - Integrity KW - toughness KW - Tenacity KW - J-Tightness DO - 10.22059/jac.2022.85486 N2 - 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. UR - https://jac.ut.ac.ir/article_85486.html L1 - https://jac.ut.ac.ir/article_85486_213d7709e295cc9d572969ef80ddc33f.pdf ER -