ON UNIQUE INDEPENDENCE GRAPHS

An independent set in a graph G is a set of vertices no two of which are joined by an edge. A graph G is called a unique independence graph if it has a unique maximum independent set. We observe that the problem of recognizing unique independence graphs is NP-hard in general, and therefore no efficient characterization can be expected in general. However, for bipartite graphs we give some combinatorial characterization of unique independence graphs.