Given a commutative ring R with identity 1≠ 0, let the set Z (R) denote the set of zero-
divisors and let Z*(R)= Z (R)\{0} be the set of non-zero zero-divisors of R. The zero-divisor …

For a finite commutative ring $\mathbb {Z} _ {n} $ with identity $1\neq 0$, the zero divisor
graph $\Gamma (\mathbb {Z} _ {n}) $ is a simple connected graph having vertex set as the …

The A γ matrix of a graph G is determined by A γ (G)=(1− γ) A (G)+ γ D (G), where 0≤ γ≤ 1,
A (G) and D (G) are the adjacency and the diagonal matrices of node degrees, respectively …

For a finite commutative ring Zn with identity 1= 0, the zero divisor graph Γ (Zn) is a simple
connected graph having vertex set as the set of non-zero zero divisors, where two vertices x …

Let R be a finite commutative ring with non zero identity. The unit graph of R denoted by G
(R) is the graph obtained by setting all the elements of R to be the vertices of a graph and …

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

The zero-divisor graph Γ (R) of a commutative unital ring R is the (simple undirected) graph
whose vertex set is all zero divisors of R except 0 R and two distinct vertices are joined by an …

For a simple connected graph G of order n, the distance signless Laplacian matrix is defined
by DQ (G)= D (G)+ Tr (G), where D (G) and Tr (G) is the distance matrix and the diagonal …

Let R be a commutative ring with identity 1≠ 0 and let Z (R)′ be the set of all non-unit and
non-zero elements of ring R. Γ′(R) denotes the cozero-divisor graph of R and is an …

Let R be a ring with unity. The cozero-divisor graph of a ring R, denoted by Γ′(R), is an
undirected simple graph whose vertices are the set of all non-zero and non-unit elements of …