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 can be computed in polynomial time.
Moazzami, D. (2019). Tenacity and rupture degree parameters for trapezoid graphs. Journal of Algorithms and Computation, 51(1), 157-164. doi: 10.22059/jac.2019.71927
MLA
Dara Moazzami. "Tenacity and rupture degree parameters for trapezoid graphs". Journal of Algorithms and Computation, 51, 1, 2019, 157-164. doi: 10.22059/jac.2019.71927
HARVARD
Moazzami, D. (2019). 'Tenacity and rupture degree parameters for trapezoid graphs', Journal of Algorithms and Computation, 51(1), pp. 157-164. doi: 10.22059/jac.2019.71927
VANCOUVER
Moazzami, D. Tenacity and rupture degree parameters for trapezoid graphs. Journal of Algorithms and Computation, 2019; 51(1): 157-164. doi: 10.22059/jac.2019.71927
)