The paper introduces the commuting graph of A-orbits and shows that several graph conditions, such as completeness or triangle-freeness, impose strong structural constraints on finite groups.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Commuting graph of $A$-orbits
The paper introduces the commuting graph of A-orbits and shows that several graph conditions, such as completeness or triangle-freeness, impose strong structural constraints on finite groups.