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 ...

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_...

the present study aimed at investigating the beneficial effects of co-administering granulocyte colony–stimulating factor (g-csf) and stem cell factor (scf) in a model of chronic liver injury induced by thioacetamide (taa). biochemical and histopathology- cal examinations were performed on serum and liver specimens. at the end of the treatment period, the rats were anesthetized with ether, seru...

A graph G of order n is k-factor-critical, where k is an integer of the same parity as n with 0 ::; k ::; n, if G X has a perfect matching for any set X of k vertices of G. A k-factor-critical graph G is called minimal if for any edge e E E(G), G e is not k-factor-critical. In this paper we study some properties of minimally k-factor-critical graphs, in particular a bound on the minimum degree,...