TY - JOUR
ID - 7980
TI - Edge-tenacity in Networks
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Moazzami, Dara
AD - University of Tehran, College of Engineering, Department of Engineering Science
Y1 - 2017
PY - 2017
VL - 49
IS - 1
SP - 45
EP - 53
KW - Edge-tenacity
KW - network vulnerability
DO - 10.22059/jac.2017.7980
N2 - 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
UR - https://jac.ut.ac.ir/article_7980.html
L1 - https://jac.ut.ac.ir/article_7980_d39c785dea8c5952d0d192f44c767675.pdf
ER -