Bounds on domination parameters in graphs: a brief survey (Q2151205)

A dominating set of a graph \(G=(V,E)\) is any subset \(S\) of \(V\) such that every vertex not in \(S\) is adjacent to at least one member of \(S\). The minimum cardinality of all dominating sets of \(G\) is called the domination number of \(G\) and is denoted by \(\gamma(G)\). This parameter has been extensively studied in the literature and there are hundreds of papers concerned with domination. Among the best know generalizations are total, independent, and connected dominating sets, each of them with the corresponding domination number. Most of the papers published so far deal with structural aspects of domination, trying to determine exact expressions for \(\gamma(G)\) or some upper and/or lower bounds for it. This paper presents a brief survey of bounds on selected domination parameters. Also, a list of open problems and conjectures is presented.