Brešar, Boštjan; Hartnell, Bert L.; Rall, Douglas F. (Attribution 3.0 International (CC BY 3.0), 2017-03-09)
A set D of vertices in a graph G is called a dissociation set if every vertex in D has at most one neighbor in D. We call a graph G uniformly dissociated if all maximal dissociation sets are of the same cardinality. ...