#### Filter Results:

#### Publication Year

2012

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Let G = (V, E) be a graph. A total restrained dominating set is a set S ⊆ V where every vertex in V \ S is adjacent to a vertex in S as well as to another vertex in V \ S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by γ t r (G), is the smallest cardinality of a total restrained dominating… (More)

- ‹
- 1
- ›