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

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

Journal: :Australasian J. Combinatorics 1999
Michael Edwin Raines Zsuzsanna Szaniszló

In this paper, we give necessary and sufficient conditions for the existence of equitable partial 4-cycle and 5-cycle systems. Furthermore, we construct equitable partial 4-cycle and 6-cycle systems of Kn,n'

Journal: :Image--the journal of nursing scholarship 1993
B M Hagerty J Lynch-Sauer K L Patusky M Bouwsema

Theory of human relatedness addresses a pervasive human concern, establishing and maintaining relatedness to others, objects, environments, society and self. This theory, derived from a series of inductive and deductive strategies, views relatedness as a functional, behavioral system rooted in early attachment behaviors. Individuals move through different states of relatedness including connect...

2015
Jessica R. Mesmer-Magnus Raquel Asencio Peter W. Seely Leslie A. DeChurch

How does organizational identity affect team functioning? We articulate and test an identity instrumentality hypothesis that suggests that organizational identity (1) directly predicts those aspects of team functioning that enable, and are instrumental in, employees’ fulfillment of their identity with the organization; and (2) indirectly predicts other aspects of team functioning not instrument...

2009
Kiran Kate Balaraman Ravindran

Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are similar in their structural relationships with other actors. Traditional methods of positional analysis such as structural equivalence, regular equivalence, and equitable partitions are either too strict or too generi...

Journal: :Discussiones Mathematicae Graph Theory 2017
Hanna Furmanczyk Marek Kubale Vahan V. Mkrtchyan

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 χ=(G). It is known that this problem is NP-hard in general case and remains so for corona graphs. In [12] Lin i Chan...

Journal: :Bond Law Review 2014

Journal: :Graphs and Combinatorics 2018

Journal: :Auslegung: a Journal of Philosophy 2000

Journal: :Journal of the Medical Library Association : JMLA 2007

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

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