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

This research deals with axial and oblique impact crash tests on simple and hybrid composite tubes. Axial and oblique impact tests have been generated on simple and hybrid composite tubes with one, two and three layers. A drop test rig was used to conduct the experiments. Furthermore, in order to gain more detailed knowledge about the crash process, finite element simulations of the experim...

this research deals with axial and oblique impact crash tests on simple and hybrid composite tubes. axial and oblique impact tests have been generated on simple and hybrid composite tubes with one, two and three layers. a drop test rig was used to conduct the experiments. furthermore, in order to gain more detailed knowledge about the crash process, finite element simulations of the experiments...

Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$‎. ‎Recently people have been using prime graphs to study simple groups‎. ‎Naturally we pose a question‎: ‎can we use prime graphs to study almost‎ ‎simple groups or non-simple groups? In this paper some results in‎ ‎this respect are obtained and as follows‎: ‎$Gcong S_p$ if and only‎ ‎if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$‎, ‎whe...

For each $$n\ge 14$$ , we provide an example of a linklessly embeddable, Tutte-4-connected graph order n. We start with fourteen, and perform 4-vertex splittings to inductively build the family triangle free, 4-connected graphs. prove graphs constructed are as minors clique sums over $$K_4$$ embeddable