Abstract
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 <TEX>$H{\cap}K{\neq}1$</TEX> 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].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
