"On the total domination number of graphs" by Bing Wei
 

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

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.