2000 character limit reached
On the Idempotent Graph of Matrix Ring (2402.11256v1)
Published 17 Feb 2024 in math.CO
Abstract: Let F be a finite field and R = M2(F) be 2x2 matrix ring over F. In this paper, we explicitly determine all the idempotents in R. Using these idempotents, we study the idempotent graph of R whose vertex set is the set of non-trivial idempotents in R and two idempotents e, f are adjacent if ef = 0 or fe = 0. It is proved that the idempotent graph of R is connected regular graph with diameter 2. Its girth is also characterized. Further, we determine the Wiener and Harary index of the idempotent graph of R.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.