نتایج جستجو برای: signed total roman k dominating function
تعداد نتایج: 2266367 فیلتر نتایج به سال:
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
A function f : V (G) → {0, 1, 2} is a Roman dominating function for a graph G = (V,E) if for every vertex v with f(v) = 0, there exists a vertex w ∈ N(v) with f(w) = 2. Emperor Constantine had the requirement that an army or legion could be sent from its home to defend a neighboring location only if there was a second army which would stay and protect the home. Thus, there are two types of armi...
A Roman dominating function of a graph G is a labeling f : V (G) −→ {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑ v∈V (G) f(v) over such functions. The Roman domination subdivision number sdγR(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order t...
For a positive integer k, a total {k}-dominating function of a digraph D is a function f from the vertex set V (D) to the set {0, 1, 2, . . . , k} such that for any vertex v ∈ V (D), the condition ∑ u∈N(v) f(u) ≥ k is fulfilled, where N(v) consists of all vertices of D from which arcs go into v. A set {f1, f2, . . . , fd} of total {k}-dominating functions of D with the property that ∑ d i=1 fi(...
Let $G=(V,E)$ be a finite and simple graph of order $n$ maximumdegree $\Delta$. A signed strong total Roman dominating function ona $G$ is $f:V(G)\rightarrow\{-1, 1,2,\ldots, \lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the condition that (i) forevery vertex $v$ $G$, $f(N(v))=\sum_{u\in N(v)}f(u)\geq 1$, where$N(v)$ open neighborhood (ii) every forwhich $f(v)=-1$ adjacent to at least one vertex...
A Roman dominating function (RDF) on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of f is w(f) = ∑ v∈V f(v). The Roman domination number is the minimum weight of an RDF in G. It is known that for every graph G, the Roman domination number of G is bounded above...
for any integer $kgeq 1$, a set $s$ of vertices in a graph $g=(v,e)$ is a $k$-tuple total dominating set of $g$ if any vertex of $g$ is adjacent to at least $k$ vertices in $s$, and any vertex of $v-s$ is adjacent to at least $k$ vertices in $v-s$. the minimum number of vertices of such a set in $g$ we call the $k$-tuple total restrained domination number of $g$. the maximum num...
a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.
A function f : V (G) → {0, 1, 2} is a Roman dominating function if for every vertex with f(v) = 0, there exists a vertex w ∈ N(v) with f(w) = 2. We introduce two fractional Roman domination parameters, γR ◦ f and γRf , from relaxations of two equivalent integer programming formulations of Roman domination (the former using open neighborhoods and the later using closed neighborhoods in the Roman...
Domination in graphs has been an extensively researched branch of graph theory. Graph theory is one of the most flourishing branches of modern mathematics and computer applications. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [ 1, 2]. Recently dominating functions in domination theory have receiv...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید