Vulnerability and economic considerations in designing network topology

Technological developments change the way of life of all people in interacting with each other, regardless of distance and time. One such interaction is the activity of the exchange of information through communication networks, which are either one-way or two-way with a variety of information, such as voices, images, and data, with the desire to have a fast and reliable delivery. If G(V, E) represents a graph or a network with a number of nodes, V = n, and the number of links, E = e, then assume the nodes are reliable and the links can fail. We investigate new parameter of connectivity called “k-component order edge-connectivity” or “component order edge-connectivity”, denoted by λ^(k)c, in which within each type of topology is then compared such as in the topology of path, cycle, star, complete, and wheel networks, then choose the best selection in vulnerability and economic point of views.