نتایج جستجو برای: double roman domination number
تعداد نتایج: 1401394 فیلتر نتایج به سال:
In a graph G, a vertex dominates itself and its neighbors. A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. The minimum cardinality taken over all, the minimal double dominating set which is called Fuzzy Double Domination Number and which is denoted as ) (G fdd . A set V S is called a Triple dominating set of a graph G if every ...
A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A set S C V is a dominating set for G if each node in V is dominated by some node in S and is a double dominating set for G if each node in V is dominated by at least two nodes in S. First we give a brief survey of Nordhaus-Gaddum results for several domination-related parameters. Then we present new inequaliti...
Let $G=(V,E)$ be a graph. A subset $Ssubset V$ is a hop dominating setif every vertex outside $S$ is at distance two from a vertex of$S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$. Theconnected hop domination number of $G$, $ gamma_{ch}(G)$, is the minimum cardinality of a connected hopdominating set of $G$...
Abstract Let G be a graph of minimum degree at least two. A set $$D\subseteq V(G)$$ D ⊆ V ( G ) is said to double total dominating if $$|N(v)\cap D|\ge 2$$ | N ...
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
we consider a dynamic domination problem for graphs in which an infinitesequence of attacks occur at vertices with guards and the guard at theattacked vertex is required to vacate the vertex by moving to a neighboringvertex with no guard. other guards are allowed to move at the same time, andbefore and after each attack and the resulting guard movements, the verticescontaining guards form a dom...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید