FINITE GROUPS WHOSE INTERSECTION GRAPHS ARE PLANAR


Kayacan S., Yaraneri E.

JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, cilt.52, sa.1, ss.81-96, 2015 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 52 Konu: 1
  • Basım Tarihi: 2015
  • Doi Numarası: 10.4134/jkms.2015.52.1.081
  • Dergi Adı: JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY
  • Sayfa Sayıları: ss.81-96

Özet

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 characterize all finite groups whose intersection graphs are planar. Our methods are elementary. Among the graphs similar to the intersection graphs, we may count the subgroup lattice and the subgroup graph of a group, each of whose planarity was already considered before in [2, 10, 11, 12].