Title of article :
On the J-Tightness of Graphs
Author/Authors :
Javan, Abolfazl Department of Algorithms and Computation - School of Engineering Science - College of Engineering - University of Tehran , Javan, Majid Department of Computer Science - Faculty of Science - University of Tehran , Jafarpour, M Department of Algorithms and Computation - School of Engineering Science - College of Engineering - University of Tehran , Moazzami, Dara Department of Algorithms and Computation - School of Engineering Science - College of Engineering - University of Tehran , Moieni, Ali Department of Algorithms and Computation - School of Engineering Science - College of Engineering - University of Tehran
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 vulnerabil-ity 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
Journal title :
Journal of Algorithms and Computation
