نتایج جستجو برای: italian domination number
تعداد نتایج: 1204782 فیلتر نتایج به سال:
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
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...
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....
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
a {em roman dominating function} on a graph $g$ is a function$f:v(g)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}a {em restrained roman dominating}function} $f$ is a {color{blue} roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} the wei...
let $g=(v(g),e(g))$ be a graph, $gamma_t(g)$. let $ooir(g)$ be the total domination and oo-irredundance number of $g$, respectively. a total dominating set $s$ of $g$ is called a $textit{total perfect code}$ if every vertex in $v(g)$ is adjacent to exactly one vertex of $s$. in this paper, we show that if $g$ has a total perfect code, then $gamma_t(g)=ooir(g)$. as a consequence, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید