K-3,K-3-free intersection graphs of finite groups

Kayacan S.

COMMUNICATIONS IN ALGEBRA, vol.45, no.6, pp.2466-2477, 2017 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 45 Issue: 6
  • Publication Date: 2017
  • Doi Number: 10.1080/00927872.2016.1233209
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.2466-2477
  • 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 all finite groups whose intersection graphs are K-3,K-3-free.