نتایج جستجو برای: friendship
تعداد نتایج: 5448 فیلتر نتایج به سال:
Correspondence: P. Stopka, Department of Zoology, South Parks Road, Oxford OX1 3PS, U.K. (email: [email protected]). L. Barrett is at the School of Biological Sciences, University of Liverpool, Liverpool L69 3BX, U.K. Hemelrijk et al. (1999), using data from a captive chimpanzee, Pan troglodytes, colony, state that there is no evidence to suggest that individuals trade ‘social services’...
This article provides a qualitative analysis of the social interactions between Chinese and Tanzanian participants within joint Chinese-Tanzanian educational initiative in Confucius Institute programming at University Dar es Salaam. The addresses issue how people involved understand their those governments context increased presence sub-Saharan Africa. shows that friendships are motivated by bo...
One of the principal themes of the Conference on Actualizing Human Potential has been that of hospitality. While hospitality has always been an important theme in Asian cultures, a more common theme in Buddhist texts has been the closely related notion of universal friendship, that is, friendship toward all sentient beings, without exception. The opposite of friendship, of course, is enmity or ...
A friendship 3-hypergraph is a 3-hypergraph in which any 3 vertices, u, v and w, occur in pairs with a unique fourth vertex x; i.e., uvx, uwx, vwx are 3-hyperedges. S os found friendship 3-hypergraphs coming from Steiner Triple Systems. Hartke and Vandenbussche showed that any friendship 3-hypergraph can be decomposed into sets of K 4 's. We think of this as a set of 4-tuples and call it a frie...
ON GRAPHS SATISFYING A STRONG ADJACENCY PROPERTY Y. Ananchuen and L. Caccetta School of Mathematics and Statistics Curtin University of Technology GPO Box U1987 Perth 6001 Western Australia. Dedicated to the memory of Alan Rahilly, 1947 1992 Let m and n be nonnegative integers and k be a positive integer. A graph G is said to have property P*(m,n,k) if for any set of m + n distinct vertices of ...
The “friendship paradox” (Feld (1991)) refers to the fact that, on average, people have strictly fewer friends than their friends have. I show that this over-sampling of the most popular people amplifies behaviors that involve complementarities. People with more friends experience greater complementarities and hence take more extreme actions. Given the friendship paradox, people then perceive m...
Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...
Friendships are essential for adolescent social development. However, they may be pursued for varying motives, which, in turn, may predict similarity in friendships via social selection or social influence processes, and likely help to explain friendship quality. We examined the effect of early adolescents' (N = 374, 12-14 years) intrinsic and extrinsic friendship motivation on friendship selec...
Background: There is still a question of whether online friendship predicts changes in face-to-face friendship (Reduction Hypothesis) or face-to-face friendship predicts changes in online friendship (Compensation Hypothesis) during adolescence. Objective: The purpose of this study was to compare these two hypotheses to determine which comes first: online friendship or offline friendship. Method...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید