On cohesion stable graphs

Abstract The cohesion of a graph was introduced to model vulnerability of a graph relative to the neighborhoods of its vertices. We are concerned in this paper with the changes in this parameter when an edge is deleted. In particular, after displaying some results on stability under edge destruction, we go on to display various infinite classes of cohesion stable graphs. Several ways in which graphs or parts of graphs may be combined to produce stable graphs are also presented, along with a look at what cannot be stated at this time.