Abelian Groups With Isomorphic Intersection Graphs

Abstract: Let G be a group. The intersection graph G(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 there is an edge between two distinct vertices X and Y if and only if X \ Y 6= 1 where 1 denotes the trivial subgroup of G: It was conjectured in [2] that two (non cyclic) finite abelian groups with isomorphic intersection graphs are isomorphic. In this paper we study this conjecture and show that it is almost true. For any inite abelian group D let Dnc be the product of all noncyclic Sylow subgroups of D: Our main result is that: given any two (nontrivial) inite abelian groups A and B; their intersection graphs G(A) and G(B) are isomorphic if and only if the groups Anc and Bnc are isomorphic, and there is a bijection between the sets of (nontrivial) cyclic Sylow subgroups of A and B satisfying a certain condition. So, in particular, two finite abelian groups with isomorphic intersection graphs will be isomorphic provided that one of the groups has no (nontrivial) cyclic Sylow subgroup. Our methods are elementary.