Related papers: Zero-Divisor Graphs of Quotient Rings
The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…
In this article, we introduce balance equations over commutative rings $R$ and associate $R$-weighted graphs to them so that solving balance equations corresponds to a consistent labeling of vertices of the associated graph. Our primary…
A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full…
A set $Z$ of vertices of a graph $G$ is a zero forcing set of $G$ if initially labeling all vertices in $Z$ with $1$ and all remaining vertices of $G$ with $0$, and then, iteratively and as long as possible, changing the label of some…
Let $R$ be a finite commutative ring with identity, and let $P$ be a proper prime ideal of $R$. The prime ideal graph $\Gamma_P(R)$ has vertex set of $R\setminus\{0\}$, where two distinct vertices $x$ and $y$ are adjacent if and only if…
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…
This paper investigates the homology groups of the clique complex associated with the zero-divisor graph of a finite commutative ring. Generalizing the construction introduced by F. R. DeMeyer and L. DeMeyer, we establish a Kunneth-type…
For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…
We study the Laplacian eigenvalues of the zero divisor graph $\Gamma\left(\mathbb{Z}_{n}\right)$ of the ring $\mathbb{Z}_{n}$ and prove that $\Gamma\left(\mathbb{Z}_{p^t}\right)$ is Laplacian integral for every prime $p$ and positive…
Call a graph $G$ zero-forcing for a finite abelian group $\mathcal{G}$ if for every $\ell : V(G) \to \mathcal{G}$ there is a connected $A \subseteq V(G)$ with $\sum_{a \in A} \ell(a) = 0$. The problem we pose here is to characterise the…
The annihilator graph $AG(R)$ of the commutative ring $R$ is an undirected graph with vertex set as the set of all non-zero zero divisors of $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $ann(xy) \neq ann(x) \cup…
The global defensive $k$-alliance is a very well studied notion in graph theory, it provides a method of classification of graphs based on relations between members of a particular set of vertices. In this paper we explore this notion in…
The paper is devoted to studying the orthogonality graph of the matrix ring over a commutative ring. It is proved that the orthogonality graph of the ring of matrices with size greater than 1 over a commutative ring with zero-divisors is…
Recently there has been a flurry of research on generalized factorization techniques in both integral domains and rings with zero-divisors, namely $\tau$-factorization. There are several ways that authors have studied factorization in rings…
We compute generators and relations for the section ring of a rational divisor on an elliptic curve. Our technique generalizes the work of O'Dorney (in genus zero) and Voight--Zureick-Brown (for specific divisors arising from the study of…
In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…
Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is well-known that such parameters are related to certain vertex…
Livine and Bonzom recently proposed a geometric formula for a certain set of complex zeros of the partition function of the Ising model defined on planar graphs. Remarkably, the zeros depend locally on the geometry of an immersion of the…
A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…
Suppose $X$ is a simple graph. The $X-$join $\Gamma$ of a set of complete or empty graphs $\{X_x \}_{x \in V(X)}$ is a simple graph with the following vertex and edge sets: \begin{eqnarray*} V(\Gamma) &=& \{(x,y) \ | \ x \in V(X) \ \& \ y…