Issue No. 02 - February (1990 vol. 39)

ISSN: 0018-9340

pp: 230-237

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.45208

ABSTRACT

<p>Two new measures of network performance, namely, the incremental distance sequence and the incremental diameter sequence, are introduced for application in network topology design. These sequences can be defined for both vertex deletions and edge deletions. A complete characterization of the vertex-deleted incremental distance sequence is presented. Proof of this characterization is constructive in nature. A condition for the feasibility of an edge-deleted incremental distance sequence and a procedure for realizing such a sequence are given. Interrelationships between the elements of incremental distance sequences and incremental diameter sequences are studied. Using these results, it is shown that a graph that has a specified diameter and a specified maximum increase in diameters for deletions of vertex sets of given cardinalities can be designed.</p>

INDEX TERMS

measures of network performance; incremental distance sequence; incremental diameter sequence; network topology design; vertex deletions; edge deletions; graph; circuit reliability; fault tolerant computing; graph theory; multiprocessor interconnection networks.

CITATION

V. Krishnamoorthy, M. Swam and K. Thulasiraman, "Incremental Distance and Diameter Sequences of a Graph: New Measures of Network Performance," in

*IEEE Transactions on Computers*, vol. 39, no. , pp. 230-237, 1990.

doi:10.1109/12.45208

CITATIONS