Add to ORKGWe determine the metric dimension of the annihilating-ideal graph of a local finite commutative principal ring and a finite commutative principal ring with two maximal ideals. We also find the bounds for the metric dimension of the annihilating-ideal graph of an arbitrary finite commutative principal ring. http://dx.doi.org/10.1017/S000497271200033
The prime ideal graph of in a finite commutative ring with unity, denoted by , is a g...
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be...
Abstract. For a commutative ring R, we can form the zero-divisor graph Γ(R) or the ideal-divisor gra...
AbstractSuppose that R is a commutative ring with identity. Let A(R) be the set of all ideals of R w...
Metric Dimension of a simple connected graph is the minimum number of vertices those are used to ide...
Abstract Let A be a commutative ring with unity. The annihilating graph of A, denoted by $${{\mathbb...
For a commutative ring R with 1 ≠ 0, a compressed zero-divisor graph of a ring R is the undirected g...
AbstractLet R be a commutative ring with identity. Let A(R) denote the collection of all annihilatin...
Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$ is called an annihilati...
The rings considered in this article are commutative with identity. For an ideal $I$ of a ring $R$, ...
summary:Let $R$ be a commutative ring. The annihilator graph of $R$, denoted by ${\rm AG}(R)$, is th...
summary:Let $R$ be a commutative ring. The annihilator graph of $R$, denoted by ${\rm AG}(R)$, is th...
summary:Let $R$ be a commutative ring with identity and $A(R)$ be the set of ideals with nonzero ann...
AbstractSuppose that R is a commutative ring with identity. Let A(R) be the set of all ideals of R w...
In this paper, we first study the interplay between the diameter of annihilating-ideal graphs and ze...
The prime ideal graph of in a finite commutative ring with unity, denoted by , is a g...
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be...
Abstract. For a commutative ring R, we can form the zero-divisor graph Γ(R) or the ideal-divisor gra...
AbstractSuppose that R is a commutative ring with identity. Let A(R) be the set of all ideals of R w...
Metric Dimension of a simple connected graph is the minimum number of vertices those are used to ide...
Abstract Let A be a commutative ring with unity. The annihilating graph of A, denoted by $${{\mathbb...
For a commutative ring R with 1 ≠ 0, a compressed zero-divisor graph of a ring R is the undirected g...
AbstractLet R be a commutative ring with identity. Let A(R) denote the collection of all annihilatin...
Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$ is called an annihilati...
The rings considered in this article are commutative with identity. For an ideal $I$ of a ring $R$, ...
summary:Let $R$ be a commutative ring. The annihilator graph of $R$, denoted by ${\rm AG}(R)$, is th...
summary:Let $R$ be a commutative ring. The annihilator graph of $R$, denoted by ${\rm AG}(R)$, is th...
summary:Let $R$ be a commutative ring with identity and $A(R)$ be the set of ideals with nonzero ann...
AbstractSuppose that R is a commutative ring with identity. Let A(R) be the set of all ideals of R w...
In this paper, we first study the interplay between the diameter of annihilating-ideal graphs and ze...
The prime ideal graph of in a finite commutative ring with unity, denoted by , is a g...
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be...
Abstract. For a commutative ring R, we can form the zero-divisor graph Γ(R) or the ideal-divisor gra...