← ALB News · curated headline

Minimal super dominating sets of maximum cardinality

arXiv Mathematics · WORLD · Mathematics · 11/19/2026, 12:00:00 AM

arXiv:2611.23464v1 Announce Type: new Abstract: Let $G = (V,E)$ be a graph. A subset $S \subseteq V$ of vertices is a super dominating set if every vertex $v \in V - S$ has a neighbour $u \in S$, whose only neighbour in $V - S$ is $v$. A set $S \subseteq V$ is called open irredundant if every vertex $u \in S$ has at least one neighbour $v \in V - S$ whose only neighbour in $S$ is $u$. In this paper we establish connections between super dominating sets and open irredundant sets, similar to the connections that exist between dominating sets and irredundant sets. In particular, we define the new parameter $\Gamma _{sp}(G)$ as the maximum cardinality of a minimal super dominating set of $G$ and calculate $\Gamma _{sp}(G)$ for some families of graphs $G$. Finally we present some properties of open irredundant sets and we will develop Gallai theorems involving domination, super domination and open irredundance parameters of graphs.

Continue to arXiv Mathematics →

You are being forwarded in 6s — stay on this page