Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Idempotent Graph of Matrix Ring

Published 17 Feb 2024 in math.CO | (2402.11256v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.