Related papers: On a new extension of the zero-divisor graph (II)

Let overline{\Gamma(R)} be the complement of zero divisor graph of a finite commutative ring R. In this article, we have provided the answer of the question (ii) raised by Osba and Alkam in their paper and prove that overline{\Gamma(R)} is…

This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…

In this article, explicit formulas for finding the determining number and the metric dimension of the zero-divisor graph of Z_n and non-Boolean semisimple rings are given. In the case of Boolean rings, an upper bound of the determining…

Let R be a commutative ring with identity and let J be an ideal of R. In this paper, we introduce and investigate the notion of the i-extended ideal-based cozero-divisor graph of R. This graph, denoted by $\overline{\Gamma''}_{Ji}(R)$, is a…

Let $R$ be a commutative ring and let $I$ be an ideal of $R$. In this paper, we introduce the cozero-divisor graph $\acute{\Gamma}_I(R)$ of $R$ and obtain some related results.

Let R be a commutative ring with identity and I be an ideal of R. The cozero-divisor graph with respect to I, denoted by $\Gamma''_I(R)$, is the graph of R with vertices {x \in R -I :xR +I \not=R} and two distinct vertices $x$ and $y$ are…

In this paper, we characterize chordal and perfect zero-divisor graphs of finite posets. Also, it is proved that the zero-divisor graphs of finite posets and the complement of zero-divisor graphs of finite $0$-distributive posets satisfy…

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V$ is independent set of $G$, if no two vertices of $S$ are adjacent. The independence number $\alpha(G)$ is the size of a maximum independent set in the graph. %An independent set with…

In this paper, we compute the strong metric dimension of the complement of the zero-divisor graph of the blow-up of a Boolean lattice. Using these results, we calculate the strong metric dimension of the total graph, the maximal graph, the…

We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify…

We find strong relationships between the zero-divisor graphs of apparently disparate kinds of nilpotent-free semigroups by introducing the notion of an \emph{Armendariz map} between such semigroups, which preserves many graph-theoretic…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

This paper introduces a new approach to associating a graph with a commutative ring. Let $R$ be a commutative ring with identity. The unit-zero divisor graph of a commutative ring $R$, denoted by $G_{UZ}(R)$, offers a novel framework for…

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…

Let R be a finite commutative ring with unity, and let G = (V, E) be a simple graph. The zero-divisor graph, denoted by {\Gamma}(R) is a simple graph with vertex set as R, and two vertices x, y \in R are adjacent in {\Gamma}(R) if and only…

The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…

In this article we introduce the zero-divisor graphs $\Gamma_\mathscr{P}(X)$ and $\Gamma^\mathscr{P}_\infty(X)$ of the two rings $C_\mathscr{P}(X)$ and $C^\mathscr{P}_\infty(X)$; here $\mathscr{P}$ is an ideal of closed sets in $X$ and…

The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…

We look for a non-zero $(0, 1)$-vector in the row space of the adjacency matrix $A(\Gamma)$ of a graph $\Gamma,$ provided $\Gamma$ has at least one edge. Akbari, Cameron, and Khosrovshahi conjectured that there exists a non-zero…

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…