نتایج جستجو برای: equitable relatedness fulfillment

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

Journal: :Philosophy of the Social Sciences 2015

Journal: :Ethical Theory and Moral Practice 2006

2005
Michael B. W. Wolfe Joseph P. Magliano Benjamin Larsen

Processing time and memory for sentences were examined as a function of the degree of semantic and causal relatedness between sentences in short narratives. In Experiments 1–2B, semantic and causal relatedness between sentence pairs was independently manipulated. Causal relatedness was assessed through pretesting and semantic relatedness was assessed with Latent Semantic Analysis. Causal relate...

Journal: :Journal of Combinatorial Theory, Series B 1994

Journal: :University of Pennsylvania Law Review and American Law Register 1938

Journal: :iranian journal of public health 0
ramin mehrdad center for research on occupational diseases, tehran university of medical sciences, tehran, iran. khosro sadeghniiat haghighi amir hossein naseri esfahani

abdominal wall hernia is common but reliable scientific data about its work relatedness is very limited and inconsistent. in this paper, a less common type of abdominal wall hernia in a 30 year old male worker is presented with recurrence after first surgery when he returned to work. in contrast with almost all kinds of hernia, a lifelong limitation for heavy lifting was recommended. it seems t...

Journal: :Journal of Practitioner Research 2020

2006
Hanna Furmańczyk

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by χ=(G). It is interesting to note that if a graph G is equitably k-colorable, it does not imply that it is equitab...

2017

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

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

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