Block graphs with unique minimum dominating sets (Q5948982)

The author presents different characterizations of block graphs with unique minimum dominating sets. This is an interesting and non-trivial extension of a 1994 theorem by \textit{G. Gunther, B. Hartnell, L. R. Markus}, and \textit{D. Rall} [Congr. Numerantium 101, 55-63 (1994; Zbl 0836.05045)] for trees. One of the conditions leads to a linear time algorithm to check whether there exists a unique dominating set in a block graph.