Structure of intersection graphs

Abstract

<p style="text-align: left;" dir="ltr"> Let <em>G</em> be a finite group and let <em>N</em> be a fixed normal subgroup of <em>G</em>. In this paper, a new kind of graph on <em>G</em>, namely the intersection graph is defined and studied. We use <img src="/public/site/images/ikhsan/equation.png" alt="" width="6" height="4" /> to denote this graph, with its vertices are all normal subgroups of <em>G</em> and two distinct vertices are adjacent if their intersection in <em>N</em>. We show some properties of this graph. For instance, the intersection graph is a simple connected with diameter at most two. Furthermore we give the graph structure of <img src="/public/site/images/ikhsan/equation_(1).png" alt="" width="6" height="4" /> for some finite groups such as the symmetric, dihedral, special linear group, quaternion and cyclic groups. </p>