نتایج جستجو برای: strong feasible basis
تعداد نتایج: 816093 فیلتر نتایج به سال:
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...
The paper deals with the best unbiased estimators of the blocked compound symmetric covariance structure for m−variate observations over u sites under the assumption of multivariate normality. The free-coordinate approach is used to prove that the quadratic estimation of covariance parameters is equivalent to linear estimation with a properly defined inner product in the space of symmetric matr...
A k-hypertournament is a complete k-hypergraph with each k-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k-hypertournament, the score si (losing score ri) of a vertex vi is the number of arcs containing vi in which vi is not the last element (in which vi is the last element). The total score of vi is defined as ti = si − ri. In this ...
qasāma is one of the proofs for homicide, which will be reliable in case of the existence of lawth (strong suspicion). there are two major views on how it is implemented. in sum, the first view deems as necessary swearing fifty oaths by fifty people; however the second view deems as sufficient swearing of fifty oaths by the claimant for proving the crime. the second view is a generally accepted...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید