Extremal Problems Related to the Cardinality Redundance of Graphs

Daniel McGinnis, Nathan Shank

A dominating set of a graph $G$ is a set of vertices $D$ such that for all $v\in V(G)$, either $v\in D$ or $(v,d)\in E(G)$ for some $d\in D$. The cardinality redundance of a ve…