Equistable graphs
N. V. R. Mahadev, Uri N. Peled, Feng Wei Sun · Journal of Graph Theory · 1994
Abstract An equistable graph is a graph for which the incidence vectors of the maximal stable sets are the 0–1 solutions of a linear equation. A necessary condition and a sufficient condition for equistability are given. They are used to characterize the equistability of various classes of perfect graphs, outerplanar graphs, and pseudothreshold graphs. Some classes of equistable graphs are shown to be closed under graph substitution.