Publication Type:

Journal Article

Source:

International Journal of Applied Engineering Research, Research India Publications, Volume 10, Number 16, p.37070-37075 (2015)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84942045486&partnerID=40&md5=9255168efa5844f171c29d12cac82a6f

Abstract:

Communication is a critical issue in the design of a parallel and distributed system. The speed of communication of an interconnection network is related to its diameter. The diameter is a measure of efficiency for studying the effects of link failures of a network with maximum time-delay or signal degradation. If some fault occurs on links or nodes of a network, then efficiency of the network will be affected. A good network must be hard to disrupt and the transmissions must remain connected even if some vertices or edges fail. Hence, to increase the efficiency of message transmission we have to decrease the diameter of a graph. Thus, the notion of diameter vulnerability has great applications in networks. A survey is given on the results concerning, how the diameter of different graph classes are affected by the removal and the addition of edges (presence of edge faults). © Research India Publications.

Notes:

cited By 0

Cite this Research Publication

A. Sab Revathy, Nair, R. Rab, and Chithra, M. Rbc, “A survey on - How the diameter of a graph is affected by the removal and the addition of edges”, International Journal of Applied Engineering Research, vol. 10, pp. 37070-37075, 2015.