نتایج جستجو برای: 2 rainbow dominating function
تعداد نتایج: 3471341 فیلتر نتایج به سال:
Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
OF THE DISSERTATION Applications and Variations of Domination in Graphs by Paul Andrew Dreyer, Jr. Dissertation Director: Fred S. Roberts In a graph G = (V, E), S ⊆ V is a dominating set of G if every vertex is either in S or joined by an edge to some vertex in S. Many different types of domination have been researched extensively. This dissertation explores some new variations and applications...
A two-valued function f defined on the vertices of a graph G (V, E), I : V -+ {-I, I}, is a signed dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every v E V, f(N[v]) 2: 1, where N(v] consists of v and every vertex adjacent to v. The of a signed dominating function is ICV) = L f( v), over all vertices v E V. The signed domination...
Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can considered as rainbow k-coloring if every two vertices x y in has an x- path. Therefore, no path's edges receive the same color; this condition is called “rainbow path”. The smallest positive integer k, designated by rc(G), connection number. Thus, k-coloring. Meanwhile, strong within for h...
This article proposes that South Africa, as multi-lingual country, has unique potential and that this potential is not to be found in some or other essence of what it means to be African, but in the daily struggles, frustrations and possibilities of life in a fragmented and divided multilingual society. In this fragmented and ‘impossible’ society there are moments (maybe rare moments) of true u...
The Debye series is developed for electromagnetic scattering by a spheroid in order to decompose the far-zone fields into various physical processes. The geometrical rainbow angle and supernumerary spacing parameter are determined from the Debye intensity by fitting the results to an Airy function and comparing them to their assumed values in ray optics and Airy theory, respectively. Eccentrici...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید