نتایج جستجو برای: s set
تعداد نتایج: 1313407 فیلتر نتایج به سال:
Let $G$ be a finite group and $pi(G)$ be the set of all the prime divisors of $|G|$. The prime graph of $G$ is a simple graph $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct vertices $p$ and $q$ are joined by an edge if and only if $G$ has an element of order $pq$, and in this case we will write $psim q$. The degree of $p$ is the number of vertices adjacent to $p$ and is ...
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex set that is not properly contained in any S-free convex set. We show that maximal S-free convex sets are polyhedra. This result generalizes a result of Basu et al. [6] for the case where S is the set of integer points in a r...
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex set that is not properly contained in any S-free convex set. We show that maximal S-free convex sets are polyhedra. This result generalizes a result of Basu et al. [6] for the case where S is the set of integer points in a r...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید