نتایج جستجو برای: co roman dominating function

تعداد نتایج: 1534157  

Journal: :CoRR 2018
Gilad Kutiel

Given an undirected graph G = (V,E) and a weight function w : E → R, the Minimum Dominating Tree problem asks to find a minimum weight sub-tree of G, T = (U,F ), such that every v ∈ V \U is adjacent to at least one vertex in U . The special case when the weight function is uniform is known as the Minimum Connected Dominating Set problem. Given an undirected graph G = (V,E) with some subsets of ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز 1389

henri-alban fournier (dit alain-fournier) est né le 3 octobre 1886 à la chapelle- dangillon dans le cher. il a passé son enfance en sologne et en bas-berry où ses parents étaient instituteurs. il a poursuivi des études secondaires au lycée lakanal, à sceaux, près de paris, où il a préparé sans succès le concours d’entrée à l’ecole normale supérieure. mobilisé dès la déclaration de guerre, en ao...

2002
Francis Rousseaux

When, as teenagers, we visited the historic site of Vaison-la-Romaine in Southern France, the discovery of Roman capitals buried under the foundations of a mediaeval church was really astounding. How, besides reusing full blocks of the antique architecture, the builders dared reduce the most worked Roman stones to the humble function of backfill? Have new builders become totally disrespectful t...

Journal: :Australasian J. Combinatorics 2004
Laura M. Harris Johannes H. Hattingh

A two-valued function f defined on the vertices of a graph G = (V,E), f : V → {−1, 1}, is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. That is, for every v ∈ V, f(N(v)) ≥ 1, where N(v) consists of every vertex adjacent to v. The weight of a total signed dominating function is f(V ) = ∑ f(v), over all vertices v ∈ V . The total ...

‎Let G be a graph‎. ‎A 2-rainbow dominating function (or‎ 2-RDF) of G is a function f from V(G)‎ ‎to the set of all subsets of the set {1,2}‎ ‎such that for a vertex v ∈ V (G) with f(v) = ∅, ‎the‎‎condition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled‎, wher NG(v)  is the open neighborhood‎‎of v‎. ‎The weight of 2-RDF f of G is the value‎‎$omega (f):=sum _{vin V(G)}|f(v)|$‎. ‎The 2-rainbow‎‎d...

Journal: :Theor. Comput. Sci. 1996
Yancai Zhao Liying Kang Moo Young Sohn

A three-valued function f defined on the vertices of a graph G = ( V, E), f : V 4 {-I. 0. I }, is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every 1~ t V, ,f(N[o]) > 1, where N[c] consists of I: and every vertex adjacent to 1’. The weight of a minus dominating function is f(V) = c f(u), over all vertices L: t V. The m...

2014
Erkan Demirkan Mehmet Kutlu Mitat Koz Mehmet Özal Mike Favre

The aim of the present study was to examine physical fitness differences between Freestyle and Greco-Roman junior wrestlers. One hundred twenty-six junior wrestlers, comprising 70 Freestyle and 56 Greco-Roman wrestlers, participated in this study. The somatic and physical fitness profile included body mass, body height, body mass index, body composition, flexibility, maximal anaerobic power of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید