@article { author = {Javan, Abolfazl and Javan, Majid and Jafarpour, M. and Moazzami, Dara and Moieni, Ali}, title = {On the J-Tightness of Graphs}, journal = {Journal of Algorithms and Computation}, volume = {53}, number = {2}, pages = {57-74}, year = {2021}, publisher = {University of Tehran}, issn = {2476-2776}, eissn = {2476-2784}, doi = {10.22059/jac.2021.85198}, abstract = {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.}, keywords = {network vulnerability,connectivity,binding number,Scattering Number,Rapture Degree,Integrity,toughness,Tenacity,J-Tightness}, url = {https://jac.ut.ac.ir/article_85198.html}, eprint = {https://jac.ut.ac.ir/article_85198_16f7e01ebb567dded106d4fdbc2ad3e9.pdf} }