On the total domination number of graphs

Authors

Bing Wei, University of Mississippi

Document Type

Lecture

Publication Date

2-13-2003

Abstract

A total dominating set in a graph G is a subset A of vertices such that every vertex in G is adjacent to a vertex in A. The total domination number of a graph G is defined as the cardinality of the smallest total dominating set. Some results on the total domination number of graphs will be presented and some related problems will be proposed. We will also give a proof of a recent conjecture of Favaron et al.

Relational Format

presentation

Recommended Citation

Wei, Bing, "On the total domination number of graphs" (2003). Combinatorics Seminar. 117.
https://egrove.olemiss.edu/math_combinatorics/117