Let be a graph. Let denote the minimum cardinality of a dominating set in . Let , respectively , denote the maximum, respectively minimum, cardinality of a maximal independent set in . We show , where is the number of vertices of . A straightforward construction shows that given any there exists a graph such that and is an induced subgraph of , making classification of these minimum graphs difficult.
We then focus on the subclass of these graphs with the stronger condition that . For such graphs and thus the graphs are well-covered. If is a graph with , we have . We give a catalogue of all well-covered graphs with and . Again we establish that given any we can construct such that is an induced subgraph of and satisfies . In fact, the graph can be constructed so that . We remark that may be much larger than .
We conclude the paper by analyzing integer solutions to . In particular, for each , the values of that satisfy the equation form an interval. When is a perfect square, this interval contains only one value, namely . For each solution to the equation, there exists a graph with vertices, maximum degree , and .