For a graph $G=(V(G),E(G))$, an Italian dominating function (ID function) of $G$ is $f:V(G)\rightarrow \{0,1,2\}$ such that for each vertex $v\in V(G)$ with $f(v)=0$, $f(N(v))\geq2$, is, either there $u \in N(v)$ $f (u) = 2$ or are two vertices $x,y\in $f(x)=f(y)=1$. A covering (CID if $f$ ID and $\{v\in V(G)\mid f(v)\neq0\}$ cover set. The domination number number) $\gamma_{cI}(G)$ the minimum...

Abstract A set of vertices in a graph is dominating if every vertex or adjacent to . If, addition, an independent set, then set. The domination number the minimum cardinality , while We prove that for all integers it holds connected ‐regular graph, with equality and only result was previously known This affirmatively answers question Babikir Henning.

For a graph $G=(V(G),E(G))$, an Italian dominating function (ID function) $f:V(G)\rightarrow\{0,1,2\}$ has the property that for every vertex $v\in V(G)$ with $f(v)=0$, either $v$ is adjacent to assigned $2$ under $f$ or least two vertices $1$ $f$. The weight of ID $\sum_{v\in V(G)}f(v)$. domination number minimum taken over all functions $G$. In this paper, we initiate study variant functions....

Let G = (V,E) be a graph. A subset S ⊆ V is a dominating set of G if every vertex not in S is adjacent to a vertex in S. A set D̃ ⊆ V of a graph G = (V,E) is called an outer-connected dominating set for G if (1) D̃ is a dominating set for G, and (2) G[V \ D̃], the induced subgraph of G by V \ D̃, is connected. The minimum size among all outer-connected dominating sets of G is called the outerconnec...

Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:Vrightarrow{0,1,2,3}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one vertex assigned $3$ under $f$, whereas if $f(v)=1$, then the vertex $v$ must be adjacent to at least one vertex assigned $2$ or $3$. The weight of a DR...

Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied Hamiltonian-related properties of supergrid and their subclasses graphs. this paper, propose a generalized graph class called extended Extended include grid graphs, diagonal triangular as study problems domination independent on A dominating set is subset vertices it, such t...

In a graph, a vertex is said to dominate itself and all its neighbors. A double dominating set of a graph G is a subset of vertices that dominates every vertex of G at least twice. The double domination number γ×2(G) is the minimum cardinality of a double dominating set of G. A graph G without isolated vertices is called edge removal critical with respect to double domination, or just γ×2-criti...

In a graph, vertex dominates itself and its neighbors. A subset S of vertices graph G is double dominating set if every at least twice. The domination number γ ×2 ( ) the minimum cardinality . this paper, we prove that maximal outerplanar order n bounded above by + k /2, where pairs consecutive degree two with distance 3 on outer cycle. We also ×2( ≤ 5 /8 for Hamiltonian planar ≥ 7.