Edge-tenacity in Networks

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 dierently how much eort 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, Te(G), a new invariant, for several classes of graphs. Basic properties and some bounds for edge-tenacity, Te(G), are developed. Edge-tenacity values for various classes of graphs are calculated and future work and concluding remarks are summarized .