نتایج جستجو برای: V-perfect group
تعداد نتایج: 1292925 فیلتر نتایج به سال:
a finite group g is said to be a pos-group if for each x in g the cardinality of the set {y in g | o(y) = o(x)} is a divisor of the order of g. in this paper we study the structure of pos-groups with some cyclic sylow subgroups.
a finite group g is said to be a pos-group if for each x in g the cardinality of the set {y in g | o(y) = o(x)} is a divisor of the order of g. in this paper we study the structure of pos-groups with some cyclic sylow subgroups.
let $g$ be a group and $a=aut(g)$ be the group of automorphisms of $g$. then the element $[g,alpha]=g^{-1}alpha(g)$ is an autocommutator of $gin g$ and $alphain a$. also, the autocommutator subgroup of g is defined to be $k(g)=langle[g,alpha]|gin g, alphain arangle$, which is a characteristic subgroup of $g$ containing the derived subgroup $g'$ of $g$. a group is defined...
chapter one is devotod to collect some notion and background informations, which are needed in the next chapters. it also contains some important statements which will be proved in a more general context later in this thesis. in chapter two, we show that if the marginal factor-group is of order np1...pk,n>1, then we obtain a bound for the order of the verbal subgroup. also a bound for the bear-...
we commence by using from a new norm on l1(g) the -algebra of all integrable functions on locally compact group g, to make the c-algebra c(g). consequently, we find its dual b(g), which is a banach algebra so-called fourier-stieltjes algebra, in the set of all continuous functions on g. we consider most of important basic theorems about this algebra. this consideration leads to a rather com...
we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید