Prime Graph over Cartesian Product over Rings and Its Complement

Abstract

Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc. There is currently a bridge between graphs and algebra, especially an algebraic structures, namely theory of graph algebra. One of researchs on graph algebra is a graph that formed by prime ring elements or called prime graph over ring R. The prime graph over commutative ring R (PG(R))) is a graph construction with set of vertices V(PG(R))=R and two vertices x and y are adjacent if satisfy xRy={0}, for x≠y. Girth is the shortest cycle length contains in PG(R) or can be written gr(PG(R)). Order in PG(R) denoted by |V(PG(R))| and size in PG(R) denoted by |E(PG(R))|. In this paper, we discussed prime graph over cartesian product over rings Z_m×Z_n and its complement. We focused only for m=p_1, n=p_2 and m=p_1, n=〖p_2〗^2, where p_1 and p_2 are prime numbers. Then, we obtained some properties related to order and size, degree, and girth. We also observe some examples. Moreover, we found that a correction in the statement of (Pawar & Joshi, 2019) about the complement graph over prime graph over a ring and gave a counter example for that.

Keywords

• prime graph
• commutative ring
• cartesian product.