Connectivity of intersection graphs of finite groups

Creative Commons License

Kayacan S.

COMMUNICATIONS IN ALGEBRA, cilt.46, sa.4, ss.1492-1505, 2018 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 46 Konu: 4
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1080/00927872.2017.1347662
  • Sayfa Sayıları: ss.1492-1505


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.