Page 1

Displaying 1 – 11 of 11

Showing per page

On the diameter of the intersection graph of a finite simple group

Xuanlong Ma (2016)

Czechoslovak Mathematical Journal

Let G be a finite group. The intersection graph Δ G of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G , and two distinct vertices X and Y are adjacent if X Y 1 , where 1 denotes the trivial subgroup of order 1 . A question was posed by Shen (2010) whether the diameters of intersection graphs of finite non-abelian simple groups have an upper bound. We answer the question and show that the diameters of intersection...

On the intersection graph of a finite group

Hossein Shahsavari, Behrooz Khosravi (2017)

Czechoslovak Mathematical Journal

For a finite group G , the intersection graph of G which is denoted by Γ ( G ) is an undirected graph such that its vertices are all nontrivial proper subgroups of G and two distinct vertices H and K are adjacent when H K 1 . In this paper we classify all finite groups whose intersection graphs are regular. Also, we find some results on the intersection graphs of simple groups and finally we study the structure of Aut ( Γ ( G ) ) .

On totally inert simple groups

Martyn Dixon, Martin Evans, Antonio Tortora (2010)

Open Mathematics

A subgroup H of a group G is inert if |H: H ∩ H g| is finite for all g ∈ G and a group G is totally inert if every subgroup H of G is inert. We investigate the structure of minimal normal subgroups of totally inert groups and show that infinite locally graded simple groups cannot be totally inert.

Currently displaying 1 – 11 of 11

Page 1