Can I read Edge-tenacious networks on EtoBox?

Edge-tenacious networks by Barry L. Piazza; Fred S. Robertst; Sam K. Stueckle is a Computer Science article available to read on EtoBox.

What is Edge-tenacious networks about?

## Massachusetts 021 15 The stability of a (communication or transportation) network composed of (processing) nodes and (communication or transportation) links is of prime importance to network designers. As the network begins losing links or nodes, eventually, there is a loss in its effectiveness. Thus, it is desirable that networks be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible reconfiguration of the network after disruption. Many graph theoretical parameters have been used in the past to describe the stability of networks, including the vertexconnectivity and edgeconnectivity, toughness and edge-toughness, integrity and edge-integrity, and tenacity. In this paper, we study the edgetenacity of graphs. We will be primarily interested in edge-tenacious graphs, which can be considered very stable and are somewhat analogous in edgetenacity to honest graphs in edge-integrity. We prove several results about edge-tenacious graphs as well as find numerous classes of edge-tenacious graphs. 0 7995 John Wiley & Sons, Inc.

Who reads Edge-tenacious networks?

Author

Barry L. Piazza; Fred S. Robertst; Sam K. Stueckle

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0028-3045)

Published

1995

Language

EN

Field

Computer Science (Physical Sciences)