Locating and total dominating sets in trees

Authors:
Teresa W. Haynes;Michael A. Henning;Jamie Howard
Affiliations:
Department of Mathematics, East Tennessee State University, Johnson City, TN;School of Mathematical Sciences, University of KwaZulu-Natal, Pietermaritzburg, South Africa;Department of Mathematics, East Tennessee State University, Johnson City, TN
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 2
Cited 2

Domination and location in acyclic graphs

Networks
Resolvability in graphs and the metric dimension of a graph

Discrete Applied Mathematics

Locating and paired-dominating sets in graphs

Discrete Applied Mathematics
Bounds on the locating-total domination number of a tree

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

A set S of vertices in a graph G = (V, E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.