Extremal Graphs for Inequalities Involving Domination Parameters

Document Type

Article

Publication Date

4-6-2000

Description

A characterization of n-vertex isolate-free connected graphs G whose domination number γ(G) satisfies γ(G) = [n/2] is obtained. This result enables us to obtain extremal graphs of inequalities which bound the sum of two domination parameters in isolate-free graphs.

Share

COinS