The greedy algorithm for domination in graphs of maximum degree 3

  • Authors:

  • Suzanne M. Seager

  • Affiliations:

  • Mount Saint Vincent University, Halifax, NS, Canada

  • Venue:
  • Information Processing Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.89

Visualization

Abstract

We show that for a connected graph with n nodes and e edges and maximum degree at most 3, the size of the dominating set found by the greedy algorithm is at most 10n - 2e/13 if e ≤ 11/10n, 11n - 4e/11 if 11/10n ≤ e ≤ 11/8n, and 10n - 4e/9 if e ≥ 11/8n.