Graphs with unique maximum independent sets (Q1069954)

A graph is a unique independence graph if it has a unique independent set of vertices of maximal cardinality. If, moreover, the complement of the set of vertices is also independent, the graph is called a strong unique independence graph. The authors prove the following theorem: A connected graph is a strong unique independence graph if and only if it is bipartite and has a spanning tree in which the distance between any two end vertices is even. Further, a characterization of unique independence trees is given.