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

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

Journal: :Shanlax International Journal of Arts, Science and Humanities 2022

پایان نامه :0 1374

the following null hypothesis was proposed: h : there is no significant difference between the use of semantically or communicatively translates scientific texts. to test the null hypothesis, a number of procedures were taken first, two passages were selected form soyrcebooks of food and nutrition industry and gardening deciplines. each, in turn, was following by a number of comprehension quest...

Journal: :Discrete Mathematics 2008

Journal: :Discrete Mathematics 2008

Journal: :Bulletin of the Malaysian Mathematical Sciences Society 2015

Journal: :Postgraduate medical journal 2014
John Launer

One of the wealthiest and most popular authors of the twentieth century was a doctor. His best known book included some vivid accounts of his experiences as a medical student. It is a masterpiece, but also provides the richest first-hand description we have of medicine in late Victorian London and is worth reading for that reason alone. William Somerset Maugham was born in 1874 into a family of...

Journal: :International journal of sino-western studies 2023

Without doubt, Gerhard Roth belongs to a group of contemporary prominent neuroscientists in continental Europe who argue for deterministic interpretation brain science findings. In their opinion, mental phenomena can be completely traced back biological-neuronal processes. The human being is determined his behavior - claim that arouses highly theological and philosophical interest. Is freedom a...

Journal: :Discrete Mathematics 2008
Johannes H. Hattingh Andrew R. Plummer

Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. We define the restrained bondage number br(G) of a nonempty graph G to be the minimum cardinality among all sets of edges E′ ⊆...

Journal: :Electr. J. Comb. 2016
Dieter Mitsche Xavier Pérez-Giménez Pawel Pralat

A dominating set of a graph is a subset D of its vertices such that every vertex not in D is adjacent to at least one member of D. The domination number of a graph G is the number of vertices in a smallest dominating set of G. The bondage number of a nonempty graph G is the size of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination...

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

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