In graph theory, the outer boundary of a subgraph H of a graph G is the set of vertices of G not in H that have a common edge with a vertex in H. Its inner boundary is the set of vertices of H that have a common edge with a vertex not in H. The edge boundary of H, denoted by ∂H, is the set of edges between a vertex in H and a vertex not in H.