Equistable chordal graphs Original Research Article

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a chordal graph is equistable if and only if every two adjacent non-simplicial vertices have a common simplicial neighbor.