#### Graduation Year

2005

#### Document Type

Thesis

#### Degree

M.A.

#### Degree Granting Department

Mathematics

#### Major Professor

Stephen Suen, Ph.D.

#### Committee Member

Natasha Jonoska, Ph.D.

#### Committee Member

Gregory McColm, Ph.D.

#### Keywords

Connected dominating set, Algorithms, Breadth first search, Random graphs, Local optimization

#### Abstract

A connected dominating set *D* is a set of vertices of a graph *G = (V, E)* such that every vertex in *V − D* is adjacent to at least one vertex in *D* and the subgraph hDi induced by the set D is connected. The connected domination number γc*(G)* is the minimum of the cardinalities of the connected dominating sets of *G.* The problem of finding a minimum connected dominating set *D* is known to be NP-hard. Many polynomial time algorithms that achieve some approximation factors have been provided earlier in finding a minimum connected dominating set. In this work, we present a survey on known properties of graph domination as well as some approximation algorithms. We implemented some of these algorithms and tested them with random graphs and compared their performance in finding a minimum connected dominating set *D*. We present the breadth first search algorithm as a heuristic for finding a connected dominating set whose cardinality is hopefully close to that of a minimum connected dominating set. The algorithm finds a spanning tree *T* of the graph* G = (V, E)* using breadth first search, and picks up the non-leaf nodes as the connected dominating set *D*. There are graphs for which the Breadth first search heuristic does not work so well. We implemented some local optimization procedures that would improve the performance of the breadth first search heuristic in finding the minimum connected dominating set *D*.

#### Scholar Commons Citation

Mahalingam, Gayathri, "Connected Domination in Graphs" (2005). *Graduate Theses and Dissertations.*

https://digitalcommons.usf.edu/etd/2961