In this paper, we extend our investigation about the generalized comaximal graph
introduced in Biswas et al.(Discrete Math Algorithms Appl 11 (1): 1950013, 2019a). The …

Topological indices are numerical parameters that indicate the topology of graphs or
hypergraphs. A hypergraph H=\(V\(H\), E\(H\)\) consists of a vertex set V\(H\) and an edge set …

Let $ R $ be a commutative ring with unity. The prime ideal sum graph $\text {PIS}(R) $ of the
ring $ R $ is the simple undirected graph whose vertex set is the set of all nonzero proper …

Let R be a ring with unity. The upper ideal relation graph Γ U (R) of the ring R is a simple
undirected graph whose vertex set is the set of all non-unit elements of R and two distinct …

Let $ R $ be a ring with unity. The\emph {idempotent graph} $ G_ {\text {Id}}(R) $ of a ring $
R $ is an undirected simple graph whose vertices are the set of all the elements of ring $ R …

Let R be a commutative ring with unity. The prime ideal sum graph PIS (R) of the ring R is
the simple undirected graph whose vertex set is the set of all nonzero proper ideals of R and …

Let $ R $ be a ring with unity. The cozero-divisor graph of a ring $ R $ is an undirected
simple graph whose vertices are the set of all non-zero and non-unit elements of $ R $ and …

Let $ R $ be a commutative ring with unity. The prime ideal sum graph of the ring $ R $ is a
simple undirected graph whose vertex set is the set of nonzero proper ideals of $ R $ and …

Let R be a commutative ring with identity 1. Then the graph of R, denoted by GP (R) which is
defined as the vertices are the elements of R and any two distinct elements a and b are …

Let G be a group. Then the order two element graph of G is the simple undirected graph
whose vertex set consists of all elements of G and two distinct vertices u, v are adjacent if …