Support the production of this course by joining Wrath of Math to access all my graph theory videos! 🛍 Check out my math fashion brand: Graph Theory course: Graph Theory exercises: Get the textbook! Business Inquiries: wrathofmathlessons@ A vertex is said to dominate itself and its neighbors. Then, a dominating set of a graph G is a vertex subset S of G such that every vertex in G is dominated by some vertex in S. This means every vertex in G-S is adjacent to some vertex in S. A dominating set of minimum cardinality is a minimum dominating set, and the cardinality of such a set is the domination number of the graph. #GraphTheory ★DONATE★ ◆ Support Wrath of Math on Patreon: ◆ Donate on PayPal: Follow Wrath of Math on... ● Instagram: ● TikTok: @wrathofmathedu ● X: