Related papers: A note on Vizing's conjecture
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all…
The total domination number $\gamma_{t}(G)$ of a graph $G$ is the cardinality of a smallest set $D\subseteq V(G)$ such that each vertex of $G$ has a neighbor in $D$. The annihilation number $a(G)$ of $G$ is the largest integer $k$ such that…
A set $D$ of vertices in an isolate-free graph $G$ is a semitotal dominating set of $G$ if $D$ is a dominating set of $G$ and every vertex in $D$ is within distance $2$ from another vertex of $D$.The semitotal domination number of $G$ is…
A vertex subset $S$ of a graph $G$ is a dominating set if every vertex of $G$ either belongs to $S$ or is adjacent to a vertex of $S$. The cardinality of a smallest dominating set is called the dominating number of $G$ and is denoted by…
A set of vertices $X\subseteq V(G)$ is a $d$-distance dominating set if for every $u\in V(G)\setminus X$ there exists $x\in X$ such that $d(u,x) \le d$, and $X$ is a $p$-packing if $d(u,v) \ge p+1$ for every different $u,v\in X$. The…
A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by…
A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The global offensive alliance number of $G$,…
A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by…
A set $D$ of vertices in $G$ is a disjunctive dominating set in $G$ if every vertex not in $D$ is adjacent to a vertex of $D$ or has at least two vertices in $D$ at distance $2$ from it in $G$. The disjunctive domination number,…
A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $G$ is in $S$ or is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The domination number…
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a…
The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power domination number of a graph $G$, denoted $\gamma_P(G)$, is…
An eternal dominating set of a graph $G$ is a set of vertices (or "guards") which dominates $G$ and which can defend any infinite series of vertex attacks, where an attack is defended by moving one guard along an edge from its current…
For a graph $G,$ the set $D \subseteq V(G)$ is a porous exponential dominating set if $1 \le \sum_{d \in D} \left( 2 \right)^{1-dist(d,v)}$ for every $v \in V(G),$ where $dist(d,v)$ denotes the length of the shortest $dv$ path. The porous…
A locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u)…
A disjunctive dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G)\setminus D$ has a neighbor in $D$ or has at least two vertices in $D$ at distance $2$ from it. The disjunctive domination number of $G$,…
Given a directed graph $D$, a set $S \subseteq V(D)$ is a total dominating set of $D$ if each vertex in $D$ has an in-neighbor in $S$. The total domination number of $D$, denoted $\gamma_t(D)$, is the minimum cardinality among all total…
A mixed dominating set $S$ of a graph $G=(V,E)$ is a subset $ S \subseteq V \cup E$ such that each element $v\in (V \cup E) \setminus S$ is adjacent or incident to at least one element in $S$. The mixed domination number $\gamma_m(G)$ of a…
In a directed graph $D$, a vertex subset $S\subseteq V$ is a total dominating set if every vertex of $D$ has an in-neighbor from $S$. A total dominating set exists if and only if every vertex has at least one in-neighbor. We call the…
For a graph G=(V,E), the k-dominating graph of G, denoted by $D_{k}(G)$, has vertices corresponding to the dominating sets of G having cardinality at most k, where two vertices of $D_{k}(G)$ are adjacent if and only if the dominating set…