Locating and total dominating sets in trees

Teresa W. Haynes; Michael A. Henning; Jamie Howard

doi:10.1016/j.dam.2006.01.002

Locating and total dominating sets in trees

Teresa W. Haynes, Michael A. Henning, Jamie Howard

Research output: Contribution to journal › Article › peer-review

103 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1293-1300
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	154
Issue number	8
DOIs	https://doi.org/10.1016/j.dam.2006.01.002
Publication status	Published - 15 May 2006
Externally published	Yes

Keywords

Differentiating-total dominating set
Locating-total dominating set
Metric-locating-total dominating set

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2006.01.002

Cite this

@article{fcdd5f9e5dd044daa3c75b355c13510e,

title = "Locating and total dominating sets in trees",

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.",

keywords = "Differentiating-total dominating set, Locating-total dominating set, Metric-locating-total dominating set",

author = "Haynes, {Teresa W.} and Henning, {Michael A.} and Jamie Howard",

year = "2006",

month = may,

day = "15",

doi = "10.1016/j.dam.2006.01.002",

language = "English",

volume = "154",

pages = "1293--1300",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "8",

}

TY - JOUR

T1 - Locating and total dominating sets in trees

AU - Haynes, Teresa W.

AU - Henning, Michael A.

AU - Howard, Jamie

PY - 2006/5/15

Y1 - 2006/5/15

N2 - 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.

AB - 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.

KW - Differentiating-total dominating set

KW - Locating-total dominating set

KW - Metric-locating-total dominating set

UR - http://www.scopus.com/inward/record.url?scp=33645877104&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2006.01.002

DO - 10.1016/j.dam.2006.01.002

M3 - Article

AN - SCOPUS:33645877104

SN - 0166-218X

VL - 154

SP - 1293

EP - 1300

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 8

ER -

Locating and total dominating sets in trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this