On commuting graphs obtained from classes of completely primary finite rings

Authors

DOI:

https://doi.org/10.51867/scimundi.maths.6.1.33

Keywords:

Chromatic Number, Clique Number, Completely Primary Rings, Finite Ring, Metric Dimension

Abstract

We study the commuting graph G(R) of a finite non-commutative ring R, where vertices are the non-central elements and edges connect distinct commuting elements. The focus is on the class C of completely primary (finite local) rings R for which the Jacobson radical J satisfies J^3 = 0 and J^2 is contained in Z(R), that is, J^2 is central, while the residue field R/J is the prime field Fp. For every R in C, we prove that R is a CC-ring, meaning that the centralizer of each non-central element is commutative. Consequently, G(R) is a disjoint union of cliques. Let d = dimFp(J) and e = dimFp(J^2). We show that a non-commutative ring exists only when d = e + 2, in which case G(R) consists of N = p + 1 cliques, each of size m = p^(e+1)(p - 1). Using this decomposition, we compute several graph invariants. In particular, the spectrum is integral, the energy is given by E = 2(p^(d+1) - p^(e+1) - p - 1), and the genus satisfies gamma = N.gamma(Km). We further characterize planarity and prove that G(R) is planar if and only if (p,e) = (2,1). Additional invariants are also determined, including the metric dimension beta = N(m - 1), clique number omega = m, chromatic number chi = m, independence number alpha = N, and domination number gamma_d = N. The theory is illustrated using the family UT3(Fp) of 3 x 3 upper triangular matrices with constant diagonal, yielding d = 3, e = 1, N = p + 1, and m = p^2(p - 1). In particular, G(UT3(F2)) is shown to consist of three disjoint copies of K4. Comparisons with known classifications of rings of orders p^4 and p^5 confirm the validity of the obtained formulas.

Downloads

Download data is not yet available.

References

Brauer, R., & Fowler, K. A. (1955). On groups of even order. Annals of Mathematics, 62, 565-583.

https://doi.org/10.2307/1970080

Akbari, S., Ghandehari, M., Hadian, M., & Mohammadian, A. (2004). On commuting graphs of semisimple rings. Linear Algebra and Its Applications, 390, 345-355. https://doi.org/10.1016/j.laa.2004.05.001

Akbari, S., Mohammadian, A., Radjavi, H., & Raja, P. (2006). On the diameters of commuting graphs. Linear Algebra and Its Applications, 418, 161-176. https://doi.org/10.1016/j.laa.2006.01.029

Nath, R. K. (2016). Spectrum and genus of commuting graphs of some classes of finite rings. Discussiones Mathematicae Graph Theory, 36, 947-958.

Nath, R. K. (2021). Genus of commuting graphs of some classes of finite rings. Journal of Algebra and Its Applications, 20, 2150047.

Chikunji, C. (2010). A classification of a certain class of completely primary finite rings. International Journal of Mathematics and Mathematical Sciences, 2010, Article ID 342859. https://doi.org/10.1007/978-3-0346-0007-1_4

Raghavendran, R. (1969). Finite associative rings. Compositio Mathematica, 21, 195-229.

Ringel, G. (1974). Map Color Theorem. Springer.

https://doi.org/10.1007/978-3-642-65759-7

Dolan, P. (1983). A graph related to the commuting of group elements. Mathematical Proceedings of the Cambridge Philosophical Society, 94, 27-32.

Chartrand, G., Eroh, L., Johnson, M. A., & Oellermann, O. R. (2000). Resolvability in graphs and the metric dimension of a graph. Discrete Applied Mathematics, 105, 99-113. (For the additive property of metric dimension over disconnected graphs.) https://doi.org/10.1016/S0166-218X(00)00198-0

Downloads

Published

2026-04-27

How to Cite

Mmasi, E. (2026). On commuting graphs obtained from classes of completely primary finite rings. SCIENCE MUNDI, 6(1), 376–389. https://doi.org/10.51867/scimundi.maths.6.1.33

Most read articles by the same author(s)