نتایج جستجو برای: struggling with alliance
تعداد نتایج: 9196709 فیلتر نتایج به سال:
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
Strategic alliance promotes enterprise resources sharing and enhances the competitiveness of the marketplace. Therefore, finding a mutually beneficial partner to make a strategic alliance is an important issue for various industries. The aim of this paper is to propose a suitable method based on Grey theory and Data Envelopment Analysis (DEA). A method predicts future business and measure opera...
Objective: This study was conducted to determine the role of therapeutic alliance and attachment styles in the prediction of treatment drop-out. Method: A descriptive-correlational method was used for the conduct of this study. A total of 234 men with substance abuse presenting to the clinics and treatment centers of Tehran were selected through purposive sampling. In case of the enjoyment of t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید