In a graph G, for a subset S of the vertex set, the induced subgraph determined by S has edge set consisting of all edges of G with both endpoints in S. The (edge) boundary, denoted by S consists of all edges containing one endpoint in S and one endpoint not in S.