Have a personal or library account? Click to login
Computing metric dimension of compressed zero divisor graphs associated to rings Cover

Computing metric dimension of compressed zero divisor graphs associated to rings

By: S. Pirzada and  M. Imran Bhat  
Open Access
|Mar 2019

Abstract

For a commutative ring R with 1 ≠ 0, a compressed zero-divisor graph of a ring R is the undirected graph ΓE(R) with vertex set Z(RE) \ {[0]} = RE \ {[0], [1]} defined by RE = {[x] : x ∈ R}, where [x] = {y ∈ R : ann(x) = ann(y)} and the two distinct vertices [x] and [y] of Z(RE) are adjacent if and only if [x][y] = [xy] = [0], that is, if and only if xy = 0. In this paper, we study the metric dimension of the compressed zero divisor graph ΓE(R), the relationship of metric dimension between ΓE(R) and Γ(R), classify the rings with same or different metric dimension and obtain the bounds for the metric dimension of ΓE(R). We provide a formula for the number of vertices of the family of graphs given by ΓE(R×𝔽). Further, we discuss the relationship between metric dimension, girth and diameter of ΓE(R).

Language: English
Page range: 298 - 318
Submitted on: Aug 6, 2018
|
Published on: Mar 4, 2019
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2019 S. Pirzada, M. Imran Bhat, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.