Related papers: On Irreducible Divisor Graphs in Commutative Rings…
In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…
A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…
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)$…
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…
For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…
As in algebraic geometry, an effective divisor class on a vertex-weighted graph is called special if also its residual class is effective. We study the question, when this is true already on the level of divisors; that is, when there exists…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
In this paper, we study the strong zero-divisor graph of a p.q.-Baer $*$-ring. We determine the condition on a p.q.-Baer $*$-ring (in terms of the smallest central projection in a lattice of central projections of a $*$-ring), so that its…
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 $\mathcal{G} = (\mathcal{V}, \mathcal{E})$ be a simple graph, an $L(2,1)$-labeling of $\mathcal{G}$ is an assignment of labels from nonnegative integers to vertices of $\mathcal{G}$ such that adjacent vertices get labels which differ by…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
Let $R$ be a commutative ring with ${\Bbb{A}}(R)$ its set of ideals with nonzero annihilator. In this paper and its sequel, we introduce and investigate the {\it annihilating-ideal graph} of $R$, denoted by ${\Bbb{AG}}(R)$. It is the…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
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…
Let R be an Artinian ring and G be the compressed zero-divisor graph associated to R. The question of when the clique number of compressed zero-divisor graphs is finite was raised by J. Coykendall, S. Sather-Wagstaff, L. Sheppardson, and S.…
We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge…
Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…
An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ${\cal P}_1, >..., {\cal P}_n$ be additive hereditary graph properties. A graph $G$ has property $({\cal…