Let G be a finite group. For fixed element g in and given subgroup H of , the relative -noncommuting graph is simple undirected whose vertex set two vertices x y are adjacent if ∈ or [ ]≠ −1 . We denote this by Γ In paper, we obtain computing formulae for degree any characterize whether tree, star graph, lollipop complete together with some properties involving isomorphism graphs. also present ...

Abstract We introduce a general two-colour interacting urn model on finite directed graph, where each at node reinforces all the urns in its out-neighbours according to fixed, non-negative, and balanced reinforcement matrix. show that fraction of balls either colour converges almost surely deterministic limit if is not Pólya type or graph such every vertex with non-zero in-degree can be reached...

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

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

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