Total domination and least domination in a tree

Abstract

The total domination number t of a graph G = (V; E) is the minimum cardinality of a dominating set D of G such that every vertex of V has at least one neighbor in D. The least domination number L of G is the minimum cardinality of a dominating set X of G whose domination number is the minimum. In this paper, we prove the following conjecture due to Odile… (More)
DOI: 10.1016/S0012-365X(02)00883-X

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics