On the Number of Parity Sets in a Graph
Charles H. C. Little · Canadian Journal of Mathematics · 1976
The graphs considered in this paper are finite and have no loops or multiple edges. If G is such a graph, we denote its vertex set by VG and its edge set by EG. If X and Y are disjoint subsets of VG, we define δ (X, Y) to be the set of edges of G that join a vertex in X to one in Y.