نتایج جستجو برای: roman dominating function
تعداد نتایج: 1235780 فیلتر نتایج به سال:
la littérature libertine française du xviiie siècle a longtemps été considérée secondaire ou inférieure dans le panorama de la littérature française à cause de sa valence subversive en opposition au roman d’inspiration bourgeoise. si ce dernier représentait l’expression triomphante de la bourgeoisie, le roman libertin n’était que son ombre : le roman bourgeois symbolisait la victoire de la stab...
A k-dominating set is a set D k V such that every vertex i 2 V nD k has at least k i neighbours in D k. The k-domination number k (G) of G is the cardinality of a smallest k-dominating set of G. For k 1 = ::: = kn = 1, k-domination corresponds to the usual concept of domination. Our approach yields an improvement of an upper bound for the domination number found then the notion of k-dominating ...
Let G be a graph with integral edge weights. A function d : V (G) → Zp is called a nowhere 0 mod p domination function if each v ∈ V satisfies ( d(v) + ∑ u∈N(v) w(u, v)d(u) ) 6= 0 mod p, where w(u, v) denotes the weight of the edge (u, v) and N(v) is the neighborhood of v. The subset of vertices with d(v) 6= 0 is called a nowhere 0 mod p dominating set. It is known that every graph has a nowher...
In standard kernelization algorithms, the usual goal is to reduce, in polynomial time, an instance (I, k) of a parameterized problem to an equivalent instance (I ′, k′) of size bounded by a function in k. One of the central problems in this area, whose investigation has led to the development of many kernelization techniques, is the Dominating Set problem. Given a graph G and k ∈ N, Dominating ...
A k-dominating set is a set D k V such that every vertex i 2 V nD k has at least k i neighbours in D k. The k-domination number k (G) of G is the cardinality of a smallest k-dominating set of G. For k 1 = ::: = kn = 1, k-domination corresponds to the usual concept of domination. Our approach yields an improvement of an upper bound for the domination number found then the notion of k-dominating ...
The practice of Common Law and Roman Law differ, even though both systems in theory permit what they don't prohibit. The Common Practice derived from Common Law in fact truly does tend to permit what it doesn't prohibit, while the Roman Practice derived from Roman Law tends to prohibit what it doesn't permit. Tracing the historical sources for the evolutionary divergence between current Roman P...
Our first tendency is to look outside Europe when searching for ancient rhetorics that do not follow the Greco-Roman tradition. After all, much of European culture was strongly influenced by Roman culture, especially following the conquests of Julius Caesar in 58-51 BCE and subsequent conquests that brought most of Europe under Roman control. Rome’s civic practices, including variations of Grec...
Let k be a positive integer and G = (V,E) be a graph of minimum degree at least k − 1. A function f : V → {−1, 1} is called a signed k-dominating function of G if ∑ u∈NG[v] f(u) ≥ k for all v ∈ V . The signed k-domination number of G is the minimum value of ∑ v∈V f(v) taken over all signed k-dominating functions of G. The signed total k-dominating function and signed total k-domination number o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید