نتایج جستجو برای: h set
تعداد نتایج: 1158391 فیلتر نتایج به سال:
Let $M$ and $N$ be two finitely generated graded modules over a standard graded Noetherian ring $R=bigoplus_{ngeq 0} R_n$. In this paper we show that if $R_{0}$ is semi-local of dimension $leq 2$ then, the set $hbox{Ass}_{R_{0}}Big(H^{i}_{R_{+}}(M,N)_{n}Big)$ is asymptotically stable for $nrightarrow -infty$ in some special cases. Also, we study the torsion-freeness of graded generalized local ...
let g be a fixed element of a finite group g. we introduce the g-noncommuting graph of g whose vertex set is whole elements of the group g and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. we denote this graph by . in this paper, we present some graph theoretical properties of g-noncommuting graph. specially, we investigate about its planarity and regularity, its clique number a...
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on $H$-free graphs, that is, graphs do not contain some fixed graph $H$ as an induced subgraph. In particular, we every $s\geq 1$, both problems are polynomial-time solvable $sP_3$-free $(sP_1+P_5)$-free graphs; here, the $sP_3$ denotes disjoint union of $s$ paths three vertices $sP_1+P_5$ isolated a path five ve...
the effect of the presence of perforations on he stresses of a plate is a problem which is of great interest in structural design and in the mathemattical theory of elasticity. among the many hole patterns that are likely to require consideration is the ring of equally spaced circular holes. the present worke investigates stress & strain analysis of a thin isotropic circular plate containing a ...
The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید