Contents

-

Minimizing β+Δ and Well Covered Graphs

Richard C. Brewster1, Gary MacGillivray2
1Dept. of Math. and Stats. Capilano College 2055 Purcell Way N. Vancouver, B.C. Canada V7J 3H5
2 Dept. of Math. and Stats. University of Victoria Victoria, B.C. Canada V8W 2Y2

Abstract

Let G be a graph. Let γ denote the minimum cardinality of a dominating set in G. Let β, respectively i, denote the maximum, respectively minimum, cardinality of a maximal independent set in G. We show γ+Δ2n1, where n is the number of vertices of G. A straightforward construction shows that given any G there exists a graph G such that γ(G)+Δ(G)=2n1 and G is an induced subgraph of G, making classification of these γ+Δ minimum graphs difficult.

We then focus on the subclass of these graphs with the stronger condition that β+Δ=2n1. For such graphs i=β and thus the graphs are well-covered. If G is a graph with β+Δ=2n1, we have β=nΔ+1. We give a catalogue of all well-covered graphs with Δ3 and β=nΔ+1. Again we establish that given any G we can construct G such that G is an induced subgraph of G and G satisfies β=nΔ+1. In fact, the graph G can be constructed so that β(G)+Δ(G)=2n1. We remark that Δ(G) may be much larger than Δ(G).

We conclude the paper by analyzing integer solutions to nΔ+1+Δ=2n1. In particular, for each n, the values of Δ that satisfy the equation form an interval. When n is a perfect square, this interval contains only one value, namely n. For each (n,Δ) solution to the equation, there exists a graph G with n vertices, maximum degree Δ, and β=nΔ+1.