On determining number and metric dimension of zero-divisor graphs

2023/08/01 by K, Muhammed Sabeel, Paramasivam, Krishnan
#05C25 #05C75 #05E40 #FOS: Mathematics #Rings and Algebras (math.RA)

paper · doi:10.48550/arxiv.2308.00796

Abstract

In this article, explicit formulas for finding the determining number and the metric dimension of the zero-divisor graph of Z_n and non-Boolean semisimple rings are given. In the case of Boolean rings, an upper bound of the determining number and the metric dimension of zero-divisor graph is determined. Further, the determining number and the metric dimension of some important graphs other than zero-divisor graphs, are proved and the open problem by Boutin, regarding the determining number of graphs is settled.

Related

• A Graph-Theoretic Approach to Ring Analysis: Dominant Metric Dimensions in Zero-Divisor Graphs
• On the strong metric dimension of the complement of the zero-divisor graph of a lattice
• On the strong metric dimension of the zero-divisor graph of a lattice
• A Graph-Theoretical Approach to Ring Analysis: An Exploration of Dominant Metric Dimension in Compressed Zero Divisor Graphs and Its Interplay with Ring Structures
• On Certain Bounds for Multiset Dimensions of Zero-Divisor Graphs Associated with Rings