Dominating Sets in Intersection Graphs of Finite Groups
Sel\c{c}uk Kayacan

TL;DR
This paper explores the properties of dominating sets in intersection graphs of finite groups, classifies abelian groups by domination number, and relates these graphs to algebraic structures like Burnside rings and topological complexes.
Contribution
It introduces a new perspective on intersection graphs of finite groups, classifies abelian groups by domination number, and connects these graphs to algebraic and topological concepts.
Findings
A subset is dominating iff its union contains all minimal subgroups.
Classified abelian groups by their domination number.
Established bounds for domination number in specific group classes.
Abstract
Let be a group. The intersection graph of 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 , and there is an edge between two distinct vertices and if and only if where denotes the trivial subgroup of . In this paper we studied the dominating sets in intersection graphs of finite groups. It turns out a subset of the vertex set is a dominating set if and only if the union of the corresponding subgroups contains the union of all minimal subgroups. We classified abelian groups by their domination number and find upper bounds for some specific classes of groups. Subgroup intersection is related with Burnside rings. We introduce the notion of intersection graph of a -set (somewhat generalizing the ordinary definition of intersection graph of a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
