Graphs with unique minimum specified domination sets (Q6063278)

Many graph parameters are defined to be the maximum or minimum size of a set with a particular property. For a parameter \(\psi\), we say a graph is \(\psi\)-unique if there is a unique set that achieves the maximum. The paper under review studies \(\psi\)-unique graphs, where \(\psi\) is a domination parameter or its variant. Most of the research on the uniqueness of dominating sets or their variants focuses on a class of graphs namely trees. This article explores the graphs with a unique set with respect to the parameters (dominating set, total dominating set, 2-dominating set, and paired dominating set) that achieve a domination parameter and determines the maximum value of the associated parameter in general graphs and in graphs without end vertices.