Related papers: A Graph-Theoretic Approach to Ring Analysis: Domin…

The zero-divisor graph $\Gamma(R)$ of a ring $R$ is a graph with nonzero zero-divisors of $R$ as vertices and distinct vertices $x,y$ are adjacent if $xy=0$ or $yx=0$. We provide an equivalence relation on a ring $R$ and express $\Gamma(R)$…

The prime ideal sum graph of a commutative unital ring $R$, denoted by $PIS(R)$, is an undirect and simple graph whose vertices are non-trivial ideals of $R$ and there exists and edge between to distinct vertices if and only if their sum is…

For an ordered subset $S = \{s_1, s_2,\dots s_k\}$ of vertices and a vertex $u$ in a connected graph $G$, the metric representation of $u$ with respect to $S$ is the ordered $k$-tuple $ r(u|S)=(d_G(v,s_1), d_G(v,s_2),\dots,$ $d_G(v,s_k))$,…

In this paper, replacing `equality' by 'equality almost everywhere' we modify several terms associated with the ring of measurable functions defined on a measure space $(X, \mathcal{A}, \mu)$ and thereby study the graph theoretic features…

The paper develops further the theory of quandle rings which was introduced by the authors in a recent work. Orderability of quandles is defined and many interesting examples of orderable quandles are given. It is proved that quandle rings…

The metric (resp. edge metric) dimension of a simple connected graph $G$, denoted by dim$(G)$ (resp. edim$(G)$), is the cardinality of a smallest vertex subset $S\subseteq V(G)$ for which every two distinct vertices (resp. edges) in $G$…

The comaximal graph $ \Gamma(R) $ of a commutative ring $R$ is a simple graph with vertex set $ R $ and two distinct vertices $ a $ and $b $ of $ \Gamma(R) $ are adjacent if and only if $ aR+bR=R $, where $ aR $ is the ideal generated by $…

For an artinian ring $R$, the directed zero-divisor graph $\Gamma(R)$ is connected if and only if there is no proper one-sided identity element in $R$. Sinks and sources are characterized and clarified for finite ring $R$, especially, it is…

Assume that $R$ is a commutative ring with nonzero identity. In this paper, we introduce and investigate zero-annihilator graph of $R$ denoted by $\mathtt{ZA}(R)$. It is the graph whose vertex set is the set of all nonzero nonunit elements…

Let $R$ be a commutative ring with identity and $S$ a multiplicative subset of $R$. First, we introduce and study the $S$-projective dimensions and $S$-injective dimensions of $R$-modules, and then explore the $S$-global dimension…

For a graph $G= (V, E)$, a Roman dominating function is a map $f : V \rightarrow \{0, 1, 2\}$ satisfies the property that if $f(v) = 0$, then $v$ must have adjacent to at least one vertex $u$ such that $f(u)= 2$. The weight of a Roman…

The mixed metric dimension ${\rm mdim}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V(G)\cup E(G)$. We say that $G$ is a max-mdim graph if ${\rm mdim}(G) = n(G)$.…

The weakly zero-divisor graph $W\Gamma(R)$ of a commutative ring $R$ is the simple undirected graph whose vertices are nonzero zero-divisors of $R$ and two distinct vertices $x$, $y$ are adjacent if and only if there exist $w\in {\rm…

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…

In this paper, two outwardly different graphs, namely, the zero divisor graph $\Gamma(C_c(X))$ and the comaximal graph $\Gamma_2^{'}(C_c(X))$ of the ring $C_c(X)$ of all real-valued continuous functions having countable range, defined on…

Let $R$ be a ring with unity. The clean graph $\text{Cl}(R)$ of a ring $R$ is the simple undirected graph whose vertices are of the form $(e,u)$, where $e$ is an idempotent element and $u$ is a unit of the ring $R$ and two vertices $(e,u)$,…

Let $(X,d)$ be a metric space. A set $S\subseteq X$ is said to be a $k$-metric generator for $X$ if and only if for any pair of different points $u,v\in X$, there exist at least $k$ points $w_1,w_2, \ldots w_k\in S$ such that $d(u,w_i)\ne…

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…

The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph's metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This…

In 1988, I. Beck introduced the notion of a zero-divisor graph of a commutative rings with $1$. There have been several generalizations in recent years. In particular, in 2007 J. Coykendall and J. Maney developed the irreducible divisor…