Connectivity of intersection graphs of finite groups

Creative Commons License

Kayacan S.

COMMUNICATIONS IN ALGEBRA, vol.46, no.4, pp.1492-1505, 2018 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 46 Issue: 4
  • Publication Date: 2018
  • Doi Number: 10.1080/00927872.2017.1347662
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1492-1505
  • Istanbul Technical University Affiliated: Yes


The intersection graph of a group G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of G, and there is an edge between two distinct vertices H and K if and only if H boolean AND K not equal 1 where 1 denotes the trivial subgroup of G. In this paper, we classify finite solvable groups whose intersection graphs are not 2-connected and finite nilpotent groups whose intersection graphs are not 3-connected. Our methods are elementary.