Document Type: Research Paper
University of Tehran, College of Engineering, Department of Engineering Science
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.