For the commuting graph of UT(4,p), the paper proves connectivity, diameter 3, clique number p^4, maximal cliques of size p^3 or p^4, and bounds on chromatic and independence numbers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Commuting Graph of Unitriangular Group UT(4; p)
For the commuting graph of UT(4,p), the paper proves connectivity, diameter 3, clique number p^4, maximal cliques of size p^3 or p^4, and bounds on chromatic and independence numbers.