Domination versus disjunctive domination in trees

Abstract

A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number, γ (G), of G is the minimum cardinality of a dominating set of G. A set S of vertices in G is a disjunctive dominating set in G if every vertex not in S is adjacent to a vertex of S or has at least two vertices in S… (More)
DOI: 10.1016/j.dam.2014.10.036

Topics

1 Figure or Table

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.