On the J-Tightness of Graphs

Document Type : Research Paper

Authors

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

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

3 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

Journal of Algorithms and Computation
Volume 53, Issue 2
December 2021
Pages 57-74

Files

Share

How to cite

Statistics