VULNERABILITY IN NETWORKS

V.AYTAC

[PDF]

Abstract

Recently dened exponential domination number is reported as a new mea- sure to graph vulnerability. It is a methodology, emerged in graph theory, for vulner- ability analysis of networks. Also, it gives more sensitive results than other available measures. Exponential domination number has great signicance both theoretically and practically for designing and optimizing networks. In this paper, it is studied how some of the graph types perform when they suer a vertex failure. When its vertices are corrupted, the vulnerability of a graph can be calculated by the exponential domination number which gives more information about the characterization of the network.

Keywords

Graph vulnerability, network design and communication, domination, expo- nential domination number, robustness, thorn graphs.