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

Title:

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

Creator:

Ma, Xuanlong

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:2247d84a-f4b7-4b53-9b9b-6b1b778b4ac0
uuid:2247d84a-f4b7-4b53-9b9b-6b1b778b4ac0
issn:0011-4642

Subject:

matematika, grafy funkcí, mathematics, graphs of functions, intersection graph, finite simple group, diameter, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

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 graphs of finite non-abelian simple groups have an upper bound 28. In particular, the intersection graph of a finite non-abelian simple group is connected., Xuanlong Ma., and Obsahuje seznam literatury

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

365-370

Source:

Czechoslovak Mathematical Journal | 2016 Volume:66 | Number:2

Harvested from:

CDK

Metadata only:

false