نتایج جستجو برای: freedom and bondage

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

Journal: :International Journal of English Literature and Social Sciences 2020

Journal: :Journal of consulting and clinical psychology 1984
V L Quinsey T C Chaplin D Upfold

Twenty heterosexual rapists, 10 non-sex-offender patients from the same maximum security psychiatric institution, and 10 men with low socioeconomic status recruited from the local community were presented with audiotaped narrations while their penile tumescence was measured. The story categories were as follows: female victim/partner (neutral situation, consenting sex, rape, nonsexual violence,...

2012
Marcin Krzywkowski

A 2-dominating set of a graph G = (V,E) is a set D of vertices of G such that every vertex of V (G) \D has at least two neighbors in D. The 2-domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b2(G), is the minimum cardinality among all sets of edges E′ ⊆ E such that δ(G − E′) ≥ 1 and γ2(G ...

Journal: :Discussiones Mathematicae Graph Theory 2008
Vladimir Samodivkin

The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every vertex of the graph is either in D or is adjacent to a member of D. Any dominating set D of a graph G with |D| = γ(G) is called a γ-set of G. A vertex x of a graph G is called: (i) γ-good if x belongs to some γ-set and (ii) γ-bad if x belongs to no γ-set. The bondage number b(G) of a nonempty gr...

Journal: :Discrete Mathematics 2013
Andrei V. Gagarin Vadim E. Zverovich

The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a graph having the domination number larger than that of G. In a sense, the bondage number b(G) measures integrity and reliability of the domination number γ(G) with respect to the edge removal, which corresponds, e.g., to link failures in communication networks. We show that, for a graph G having...

Journal: :Discrete Applied Mathematics 2014
Nasrin Dehgardi Seyed Mahmoud Sheikholeslami Lutz Volkmann

Let D = (V,A) be a finite and simple digraph. A k-rainbow dominating function (kRDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex v ∈ V with f(v) = ∅ the condition ⋃ u∈N(v) f(u) = {1, 2, . . . , k} is fulfilled, where N(v) is the set of in-neighbors of v. The weight of a kRDF f is the value ω(f) = ∑ v∈V |f(v...

2013
Amitav Acharya Mohamed Ali

Introduction On 23 rd April 1955, speaking before a session of the Political Committee of the Asian-African Conference in Bandung, Indonesia, Jawaharlal Nehru, the Prime Minister of India, launched into a bitter denunciation regional defence arrangements being promoted by the US in Asia and the Middle East. Membership in pacts such as SEATO or CENTO, argued Nehru, rendered a country a “camp fol...

Journal: :Praktyka Teoretyczna 2022

What role does the body play in subject’s formation and interpersonal exchanges? Does merely perform an instrumental function, or can it claim to be a subject of freedom? Thinking within framework intersubjectivity requires reassessing bulk philosophical Western tradition. Form first-person’s perspective endorsed by this tradition, exteriority has been reduced weakness human nature. Starting fro...

Journal: :Australasian J. Combinatorics 2014
Fu-Tao Hu Jun-Ming Xu

A Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value f(G) = ∑ u∈V f(u). The Roman domination number of G is the minimum weight of a Roman dominating function on G. The Roman bondage number of a nonempty ...

Journal: :Discussiones Mathematicae Graph Theory 2011
Nader Jafari Rad Lutz Volkmann

A Roman dominating function on a graph G is a function f : V (G) → {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 a Roman dominating function is the value f(V (G)) =

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

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