Related papers: Characterization of rings with genus two cozero-di…

Let R be a ring (not necessarily commutative ring) with identity. The clean graph Cl(R) of a ring R is a graph with vertices in the form of ordered pair (e; u), where e is an idempotent of the ring R and u is a unit of the ring R. Two…

Let $R$ be a commutative ring with identity. The involutory Cayley graph $\mathcal{G}(R)$ of $R$ is defined as the graph whose vertex set is the set of elements of $R$, where two vertices $a$ and $b$ are adjacent exactly when $(a-b)^2=1$.…

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…

Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…

This article investigates multiset dimensions in zero divisor graphs (ZD-graphs) associated with rings. Through rigorous analysis, we establish general bounds for the multiset dimension (Mdim) in ZD-graphs, exploring various commutative…

Let $R$ be a commutative ring with identity and $n\geq1$ be an integer. Let $R^{n}=R\times\cdots\times R~(n~times)$. The \textit{total dot product} graph, denoted by $TD(R,n)$ is a simple graph with elements of $R^{n}-\{(0,0,\ldots,0)\}$ as…

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…

A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a…

In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…

Let $G$ be a simple graph on the vertex set $V(G) = [n] = \{1,...,n\}$ and edge ideal $E(G)$. We consider the class of closed graphs. A closed graph is a simple graph satisfying the following property: for all edges $\{i, j\}$ and $\{k,…

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)$,…

An undirected graph is said to be cordial if there is a friendly (0,1)-labeling of the vertices that induces a friendly (0,1)-labeling of the edges. An undirected graph $G$ is said to be $(2,3)$-orientable if there exists a friendly…

In this paper we define and study a ring associated to a graph that we call the cographic toric face ring, or simply the cographic ring. The cographic ring is the toric face ring defined by the following equivalent combinatorial structures…

In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…

A graph in which every connected induced subgraph has a disconnected complement is called a cograph. Such graphs are precisely the graphs that do not have the 4-vertex path as an induced subgraph. We define a $2$-cograph to be a graph in…

The divisor graph is the non oriented graph whose vertices are the positive integers, and edges are the {a,b} such that a divides b or b divides a. Let F(x,y) be the maximum number of integers<= x belonging in one of y pairwise disjoint…

Let $(A, \oplus, *, 0)$ be an MV-algebra, $(A, \odot, 0)$ be the associated commutative semigroup, and $I$ be an ideal of $A$. Define the ideal-based zero-divisor graph $\Gamma_{I}(A)$ of $A$ with respect to $I$ to be a simple graph with…

We associate a graph to a possible non-zero zero-divisor in the group algebra of a torsion-free group.

We prove that a graph has an r-bounded subdivision of a wheel if and only if it does not have a graph-decomposition of locality r and width at most two.

In this article, we first generalize Kaplansky's zero-divisor conjecture of group-rings $K[G]$ (with $K$ a field) to the more general setting of $G$-graded rings $R=\bigoplus\limits_{n\in G}R_{n}$ with $G$ a torsion-free group. Then we…