The non-two-primes graph of a finite group
نویسندگان
1 Dipartimento di Matematica “Tullio Levi Civita”, Università di Padova, Via Trieste 63, 35121 Padova, Italy
2 Dipartimento di Matematica “Tullio Levi Civita”, Università di Padova, Via Trieste 63, 35121 Padova, Italy
doi
10.22108/toc.2025.142373.2201چکیده
To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3 distinct primes. We prove that the subgraph of this graph induced by the non-isolated vertices is connected and has diameter at most 5.
