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

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 dierent vulnerability parameters of graphs, tenacity and rupture degree are dened. In general, computing the tenacity of a graph is NP-hard and the rupture degree of a graph is NP-complete, but in this paper, we will show that these parameters can be computed in polynomial time for interval graphs.