Unique minimum domination in trees


A set D of vertices in a graph G is a distance-k dominating set if every vertex of G either is in D or is within distance k of at least one vertex in D. A distance-k dominating set of G of minimum cardinality is called a minimum distance-k dominating set of G. For any graph G and for a subset F of the edge set of G the set F is an edge dominating set of G… (More)


Figures and Tables

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


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.

Slides referencing similar topics