نتایج جستجو برای: Simple graph
تعداد نتایج: 634615 فیلتر نتایج به سال:
let $g$ be a finite group. in [ghasemabadi et al., characterizations of the simple group ${}^2d_n(3)$ by prime graph and spectrum, monatsh math., 2011] it is proved that if $n$ is odd, then ${}^2d _n(3)$ is recognizable by prime graph and also by element orders. in this paper we prove that if $n$ is even, then $d={}^2d_{n}(3)$ is quasirecognizable by prime graph, i.e...
in this paper we show that expansion of a buchsbaum simplicial complex is $cm_t$, for an optimal integer $tgeq 1$. also, by imposing extra assumptions on a $cm_t$ simplicial complex, we provethat it can be obtained from a buchsbaum complex.
the divisibility graph $mathscr{d}(g)$ for a finite group $g$ is a graph with vertex set ${rm cs}(g)setminus{1}$ where ${rm cs}(g)$ is the set of conjugacy class sizes of $g$. two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides $a$. in this paper we will find the number of connected components of $mathscr{d}(g)$ where $g$ is a simple zassenhaus group or an sp...
let g be a finite group and let $gk(g)$ be the prime graph of g. we assume that $n$ is an odd number. in this paper, we show that if $gk(g)=gk(b_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then g has a unique nonabelian composition factor isomorphic to $b_n(p)$ or $c_n(p)$ . as consequences of our result, $b_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the validity of a con...
in this paper, it was shown that , where and , and , where is not prime and , are od-characterizable.
let $g$ be a finite group. we construct the prime graph of $ g $,which is denoted by $ gamma(g) $ as follows: the vertex set of thisgraph is the prime divisors of $ |g| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ g $ contains anelement of order $ pq $.in this paper, we determine finite groups $ g $ with $ gamma(g) =gamma(l_3(q)) $, $2 leq q < 100 $ and prov...
The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
vasil'ev posed problem 16.26 in [the kourovka notebook: unsolved problems in group theory, 16th ed.,sobolev inst. math., novosibirsk (2006).] as follows:does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? conjecture: $k = 5$.in [zvezdina, on nonabelian simple groups having the same prime gr...
let $g$ be a finite group. we construct the prime graph of $ g $,which is denoted by $ gamma(g) $ as follows: the vertex set of thisgraph is the prime divisors of $ |g| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ g $ contains anelement of order $ pq $.in this paper, we determine finite groups $ g $ with $ gamma(g) =gamma(l_3(q)) $, $2 leq q < 100 $ and prov...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید