integrity of graph operations

A communication network can be considered to be highly vulnerable to disruption if the failure of few members (nodes or links) can result in no members being able to communicate with very many others. these communication networks can be modeled through graphs. there are several graph-theoretic parameters to describe the stability of graphs. but, these parameters are not sufficient to study stability of graphs. this leads to the concept of integrity of a graph. in this paper, we obtain the integrity of some graph operations and some special graphs which can help us to reconstruct the given network in such a way that it is more stable than the earlier one.