Edge vulnerability parameters of bisplit graphs

A graph is called bisplit if its vertex set can be partitioned into three stable sets I,Y and Z such that Y Z induces a complete bipartite graph (a biclique). In this paper, we investigate the edge vulnerability parameters of bisplit graphs. Let be a noncomplete connected bisplit graph with minimum vertex degree δ(G). We prove that its edge-connectivity is δ(G), and if , then its edge-toughness is . Examples are given to show that the condition cannot be dropped out. Moreover, it is shown that if Y Z<2δ(G), then the edge-integrity of G equals V(G).