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)
Tenacity and rupture degree parameters for trapezoid graphs

Dara Moazzami

Volume 51, Issue 1 , June 2019, , Pages 157-164

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

Abstract
  Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs ...  Read More

Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time

Dara Moazzami; Niloofar Vahdat

Volume 50, issue 2 , December 2018, , Pages 81-87

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

Abstract
  In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters ...  Read More