Strong resolving graph and strong metric dimension of a compressed zero divisor graph

Let [Formula: see text] be a commutative ring with [Formula: see text] and [Formula: see text] be the set of zero-divisors of [Formula: see text]. The relation on [Formula: see text] given by [Formula: see text] if and only if [Formula: see text] is an equivalence relation, where [Formula: see text]. The compressed zero divisor graph [Formula: see text] of [Formula: see text] is a simple graph whose vertex set is the set of all equivalence [Formula: see text]-classes and two distinct [Formula: see text]-classes [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text]. In this paper, the structure of strong resolving graph of [Formula: see text] is completely determined. Using the structure, we calculate the strong metric dimension of [Formula: see text].

Authors

Institutions

Publication Details

Journal
Journal of Algebra and Its Applications
Published
2025-05-23
DOI
https://doi.org/10.1142/s0219498826502609
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Strong resolving graph and strong metric dimension of a compressed zero divisor graph

F. Heydari, M. Maghasedi, M. Khazaee
Journal of Algebra and Its Applications
Graph Labeling and Dimension Problems
article

Strong resolving graph and strong metric dimension of a compressed zero divisor graph

F. Heydari, M. Maghasedi, M. Khazaee
article en

Abstract

Let [Formula: see text] be a commutative ring with [Formula: see text] and [Formula: see text] be the set of zero-divisors of [Formula: see text]. The relation on [Formula: see text] given by [Formula: see text] if and only if [Formula: see text] is an equivalence relation, where [Formula: see text]. The compressed zero divisor graph [Formula: see text] of [Formula: see text] is a simple graph whose vertex set is the set of all equivalence [Formula: see text]-classes and two distinct [Formula: see text]-classes [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text]. In this paper, the structure of strong resolving graph of [Formula: see text] is completely determined. Using the structure, we calculate the strong metric dimension of [Formula: see text].

Journal of Algebra and Its Applications
Islamic Azad University, Karaj (IR)
Openalex Percentile: Top 87%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Strong resolving graph and strong metric dimension of a compressed zero divisor graph — F. Heydari, M. Maghasedi, et al. · Journal of Algebra and Its Applications (2025) | TGRS Research Map | TGRS