Uniform Intersection Numbers and Subgroup-Based Generating Graphs of Groups

Source abstract

The uniform intersection number of a finite group $G$, denoted by $ui(G)$, is the smallest positive integer $k$ such that the intersection of any $k$ distinct maximal subgroups of $G$ is equal to its Frattini subgroup. We determine the uniform intersection number of dicyclic, dihedral, and quasi-dihedral groups. We then investigate the uniform intersection number through the subgroup-based generating graph $\mathcal{G}(G)$ of a finite group $G$. We characterize the finite groups $G$ for which both the intersection number and the uniform intersection number are equal to two, and show that this condition is equivalent to $\mathcal{G}(G)$ being complete multipartite. We also classify finite groups in terms of the diameter, girth, and perfectness of $\mathcal{G}(G)$. Finally, we show that $\mathcal{G}(\mathbb{Z}_n)$ is Hamiltonian if and only if $n=p_1^{r}p_2^{r}$, where $r\geq 2$ and $p_1$ and $p_2$ are distinct primes.