University Of Tehran Press Journal of Algorithms and Computation 2476-2776 Articles in Press 2022 01 14 On the J-Tightness of Graphs 1 18 85486 10.22059/jac.2022.85486 EN Journal Article 2022 01 14 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. https://jac.ut.ac.ir/article_85486_213d7709e295cc9d572969ef80ddc33f.pdf