Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
On the J-Tightness of Graphs
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

https://doi.org/10.22059/jac.2022.85486

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 ...  Read More

On the J-Tightness of Graphs

Abolfazl Javan; Majid Javan; M. Jafarpour; Dara Moazzami; Ali Moieni

Volume 53, Issue 2 , December 2021, , Pages 57-74

https://doi.org/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 ...  Read More

Edge-tenacity in Networks

Dara Moazzami

Volume 49, Issue 1 , June 2017, , Pages 45-53

https://doi.org/10.22059/jac.2017.7980

Abstract
  Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between ...  Read More