Domination in graph theory
Domination Number -- from Wolfram MathWorld
In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination .
Navigation menu
29 people find in your city who like Domination. Look
Description:That is, G is a split graph: From dominating set to set covering. Conversely, let D be a dominating set for G. For any graph G, its line graph L G is claw-free, and hence a minimum maximal independent set in L G is also a minimum dominating set in L G.
Views: 7411
Date: 2018-07-04
Favorited: 56
User Comments 1
Post a comment
Comment: