Document Type : Research Paper

Authors

• Abolfazl Javan ¹
• Majid Javan ²
• M. Jafarpour ¹
• Dara Moazzami ³
• Ali Moieni ¹

¹ Department of Algorithms and Computation, School of Engineering Science, College of Engineering, University of Tehran

² Department of Computer Science, Faculty of Science, University of Tehran

³ Department of Algorithms and Computation, Faculty of Engineering Science, School of Engineering, University of Tehran, Iran, and Department of Mathematics, UCLA, California, USA

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