Document Type
Lecture
Publication Date
11-17-2010
Abstract
A dominating set for a graph G = (VE) is a subset D of V such that every vertex not in D is joined to at least one vertex in D by some edge. If a dominating set D is an independent set, that is, no edge between any two vertices in D, then D is called an independent dominating set. Let (G) denote the number of vertices in a smallest dominating set for G and i(G) denote the number of vertices in a smallest independent dominating set for G. In this talk, we will begin with an introduction to the history of domination in graphs and some related basic concepts in graph theory, and then present some lower and upper bounds for both (G) and i(G). Several problems we are now working on will also be discussed.
Relational Format
presentation
Recommended Citation
Priddy, Bruce, "Domination and Independent Domination in Graphs" (2010). Combinatorics Seminar. 73.
https://egrove.olemiss.edu/math_combinatorics/73
