نتایج جستجو برای: equitable relatedness fulfillment
تعداد نتایج: 26125 فیلتر نتایج به سال:
Attachment research has traditionally focused on individual differences in global patterns of attachment to important others. The current research instead focuses primarily on within-person variability in attachments across relational partners. It was predicted that within-person variability would be substantial, even among primary attachment figures of mother, father, romantic partner, and bes...
In accordance with self-determination theory (SDT; Deci & Ryan, 1985), this study examined the relationship between autonomy support, psychological need satisfaction, motivational regulations, and exercise behavior. Participants (N5 369) were recruited from fitness, community, and retail settings. Fulfillment of the 3 basic psychological needs (i.e., competence, autonomy, and relatedness) relat...
In this paper I examine agency theories and the impact it has on corporate life today. I find substantial support (in research and real life) the teaching itself has contributed to greed and the “agency culture” that has driven many firms to their doom. When it comes to game theory and experiments people tend to be self-serving at different levels. Outside these applications most people are als...
Grounded in self-determination theory (SDT), this study aimed to examine the relationship between satisfying basic psychological needs when exercising and motivation for exercise. Participants (nmale = 324; nfemale 379) were Japanese adults who completed a survey using cross-sectional, non-experimental design. Bivariate correlations supported positive associations each need via exercise, reveal...
We confirm the equitable ∆-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or direct) products of graphs.
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this paper, we prove that if G is a graph such that for each edge xy ∈ E(G), the sum d(x)+ d(y) of the degrees of its ends is at most 2r + 1, then G has an equitable coloring with r + 1 colors. This extends the Hajnal–Szemerédi Theorem on graphs with maximum degree r and a recent conject...
For several decades, context effects in picture naming and word reading have been extensively investigated. However, researchers have found no agreement on the explanation of the effects. Whereas it has long been assumed that several types of effect reflect competition in word selection (e.g., Levelt, Roelofs, & Meyer, 1999), recently it has been argued that these effects reflect the exclusion ...
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ=(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید