A note on the integrity of middle graphs

The integrity I(G) of a noncomplete connected graph G is a measure of network invulnerability and is defined by I(G) = min{|S + m(G - S)}, where S and m(G - S) denote the the subset of V and the order of the largest component of G - S, respectively. In this paper, we determine the integrity and some other parameters of middle graphs of some classes of graphs.