Unique irredundance, domination and independent domination in graphs (Q2581412)

A subset \(D\) of the vertex set of a graph \(G\) is called irredundant if for every vertex \(v\) in \(D\) either \(v\) has a neighbor in \(V(G)\backslash D\) that has no other neighbor in \(D\) besides \(v\) or \(v\) itself has no neighbor in \(D\). The cardinalities of a minimum irredundant set, a minimum dominating set and a minimum independent dominating set are called the irredundance number, the domination number and the independent domination number, respectively. In this paper it is proved that any graph with equal irredundance and dominating numbers has a unique minimum irredundant set if and only if it has a unique minimum dominating set. The hereditary class of graphs \(G\) such that for every induced subgraph \(H\) of \(G\), \(H\) has a unique \(t\)-set if and only if \(H\) has a unique \(\gamma \)-set is characterized using a result by \textit{I. E. Zverovich} and \textit{V. E. Zverovich} [J. Graph Theory 20, 375--395 (1995; Zbl 0836.05067)]. Furthermore, for trees with equal domination and independent domination numbers a characterization of unique minimum independent dominating sets is presented, which leads to a linear time algorithm to decide whether such trees have unique minimum independent dominating sets.