AMS (American Mathematical Society)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. The objective of this paper is to study the generalized concept of edge-tenacity and determining this quantity for complete n-partite graphs.
|
Last Updated on Sunday, 25 February 2018 19:31 |