%0 Journal Article
%T Edge-tenacity in Networks
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Moazzami, Dara
%D 2017
%\ 06/01/2017
%V 49
%N 1
%P 45-53
%! Edge-tenacity in Networks
%K Edge-tenacity
%K network vulnerability
%R 10.22059/jac.2017.7980
%X 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 at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the "Tenacity" and "Edge-tenacity" of a graph. In this paper we present results on the tenacity and edge-tenacity, $T_e(G)$, a new invariant, for several classes of graphs. Basic properties and some bounds for edge-tenacity, $T_e(G)$, are developed. Edge-tenacity values for various classes of graphs are calculated and future work andconcluding remarks are summarized
%U https://jac.ut.ac.ir/article_7980_d39c785dea8c5952d0d192f44c767675.pdf