نتایج جستجو برای: twin signed total roman dominating function
تعداد نتایج: 1986623 فیلتر نتایج به سال:
Dominating sets in their many variations model a wealth of optimization problems like facility location or distributed le sharing. For instance, when a request can occur at any node in a graph and requires a server at that node, a minimumdominating set represents a minimum set of servers that serve an arbitrary single request by moving a server along at most one edge. This paper studies dominat...
Let G = (V,E) be a graph and f be a function f : V → {0, 1, 2}. A vertex u with f(u) = 0 is said to be undefended with respect to f , if it is not adjacent to a vertex with positive weight. The function f is a weak Roman dominating function (WRDF) if each vertex u with f(u) = 0 is adjacent to a vertex v with f(v) > 0 such that the function f ′ : V → {0, 1, 2} defined by f ′ (u) = 1, f ′ (v) = f...
in this thesis, structural, electronical, and optical properties of inverse pervskite(ca3pbo) in cubic phase have been investigated.the calculation have been done based on density functional theory and according to generalized gradiant approximate (gga) as correlating potential. in order to calculate the configurations, implementing in the wien2k code have been used from 2013 version. first of ...
We investigate a domination-like problem from the exact exponential algorithms viewpoint. The classical Dominating Set problem ranges among one of the most famous and studied NP -complete covering problems [6]. In particular, the trivial enumeration algorithm of runtime O∗(2n) 4 has been improved to O∗(1.4864n) in polynomial space, and O∗(1.4689n) with exponential space [9]. Many variants of th...
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
The total graph is built by joining the to its line means of incidences. We introduce a similar construction for signed graphs. Under two defnitions graph, we defne corresponding and show that it stable under switching. consider balance, frustration index number, largesteigenvalue. In regular case compute spectrum adjacency matrix spectra certain compositions, determine some with exactly main e...
Definition of dominating function on a fractional graph G has been introduced. Fractional parameters such as domination number and upper defined. Domination with fuzzy Intuitionistic environment, have found by formulating Linear Programming Problem.
Let G = ( V, E ) be a simple graph with vertex setxs V and edge set . A mixed Roman dominating function of is f : ∪ → {0, 1, 2} satisfying the condition that every element x ∈ for which f(x) 0 adjacent or incident to at least one y f(y) 2. The weight ω( ∑ domination number γ R minimum We first show problem computing * NP-complete bipartite graphs then we present upper lower bounds on number, so...
Let G = (V,E) be a simple graph. For any real function g : V −→ R and a subset S ⊆ V , we write g(S) = ∑ v∈S g(v). A function f : V −→ [0, 1] is said to be a fractional dominating function (FDF ) of G if f(N [v]) ≥ 1 holds for every vertex v ∈ V (G). The fractional domination number γf (G) of G is defined as γf (G) = min{f(V )|f is an FDF of G }. The fractional total dominating function f is de...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید