On the Strong Metric Dimension of Annihilator Graphs of Commutative Rings

2021 ◽  
Author(s):  
Sh. Ebrahimi ◽  
R. Nikandish ◽  
A. Tehranian ◽  
H. Rasouli
Keyword(s):  
Commutative Rings ◽  
Metric Dimension ◽  
Strong Metric Dimension

Metric and Strong Metric Dimension in Cozero-Divisor Graphs

2021 ◽  
Vol 18 (3) ◽  
Author(s):  
R. Nikandish ◽  
M. J. Nikmehr ◽  
M. Bakhtyiari
Keyword(s):  
Metric Dimension ◽  
Strong Metric Dimension

scholarly journals Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian

2020 ◽  
Vol 1 (2) ◽  
pp. 64
Author(s):  
Nurma Ariska Sutardji ◽  
Liliek Susilowati ◽  
Utami Dyah Purwati
Keyword(s):  
Graph Theory ◽  
Cartesian Product ◽  
Metric Dimension ◽  
Star Graph ◽  
Product Graph ◽  
Path Graph ◽  
Strong Metric Dimension ◽  
Metric Dimensions ◽  
Development Result ◽  
Corona Product

The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete graph, cycle graphs, and the result corona product graph. In the previous study have been built about strong local metric dimensions of corona product graph. The purpose of this research is to determine the strong local metric dimension of cartesian product graph between any connected graph G and H, denoted by dimsl (G x H). In this research, local metric dimension of G x H is influenced by local strong metric dimension of graph G and local strong metric dimension of graph H. Graph G and graph H has at least two order.

Variable neighborhood search for the strong metric dimension problem

2012 ◽  
Vol 39 ◽  
pp. 51-57 ◽  
Author(s):  
Nenad Mladenović ◽  
Jozef Kratica ◽  
Vera Kovačević-Vujčić ◽  
Mirjana Čangalović
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Metric Dimension ◽  
Strong Metric Dimension

Annihilating-ideal graphs of commutative rings

2019 ◽  
Vol 13 (07) ◽  
pp. 2050121
Author(s):  
M. Aijaz ◽  
S. Pirzada
Keyword(s):  
Commutative Ring ◽  
Zero Divisor ◽  
Commutative Rings ◽  
Prime Ideals ◽  
Metric Dimension ◽  
Maximal Ideals ◽  
Vertex Set

Let [Formula: see text] be a commutative ring with unity [Formula: see text]. The annihilating-ideal graph of [Formula: see text], denoted by [Formula: see text], is defined to be the graph with vertex set [Formula: see text] — the set of non-zero annihilating ideals of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] adjacent if and only if [Formula: see text]. Some connections between annihilating-ideal graphs and zero divisor graphs are given. We characterize the prime ideals (or equivalently maximal ideals) of [Formula: see text] in terms of their degrees as vertices of [Formula: see text]. We also obtain the metric dimension of annihilating-ideal graphs of commutative rings.

scholarly journals The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families

Mathematics ◽  
2020 ◽  
Vol 8 (1) ◽  
pp. 125
Author(s):  
Ismael González Yero
Keyword(s):  
Vertex Cover ◽  
Common Vertex ◽  
Metric Dimension ◽  
Minimum Cardinality ◽  
New Approach ◽  
Strong Metric Dimension ◽  
Vertex Set ◽  
Graph Families ◽  
Vertex Sets ◽  
Np Hardness

We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph. In concordance, we consider here connected graphs G whose vertex sets are represented as V ( G ) , and the following terminology. Two vertices u , v ∈ V ( G ) are strongly resolved by a vertex w ∈ V ( G ) , if there is a shortest w − v path containing u or a shortest w − u containing v. A set A of vertices of the graph G is said to be a strong metric generator for G if every two vertices of G are strongly resolved by some vertex of A. The smallest possible cardinality of any strong metric generator (SSMG) for the graph G is taken as the strong metric dimension of the graph G. Given a family F of graphs defined over a common vertex set V, a set S ⊂ V is an SSMG for F , if such set S is a strong metric generator for every graph G ∈ F . The simultaneous strong metric dimension of F is the minimum cardinality of any strong metric generator for F , and is denoted by Sd s ( F ) . The notion of simultaneous strong resolving graph of a graph family F is introduced in this work, and its usefulness in the study of Sd s ( F ) is described. That is, it is proved that computing Sd s ( F ) is equivalent to computing the vertex cover number of the simultaneous strong resolving graph of F . Several consequences (computational and combinatorial) of such relationship are then deduced. Among them, we remark for instance that we have proved the NP-hardness of computing the simultaneous strong metric dimension of families of paths, which is an improvement (with respect to the increasing difficulty of the problem) on the results known from the literature.

On the Strong Metric Dimension of Tetrahedral Diamond Lattice

2015 ◽  
Vol 9 (2) ◽  
pp. 201-208 ◽  
Author(s):  
Paul Manuel ◽  
Bharati Rajan ◽  
Cyriac Grigorious ◽  
Sudeep Stephen
Keyword(s):  
Diamond Lattice ◽  
Metric Dimension ◽  
Strong Metric Dimension

scholarly journals On the strong metric dimension of corona product graphs and join graphs

2013 ◽  
Vol 161 (7-8) ◽  
pp. 1022-1027 ◽  
Author(s):  
Dorota Kuziak ◽  
Ismael G. Yero ◽  
Juan A. Rodríguez-Velázquez
Keyword(s):  
Metric Dimension ◽  
Product Graphs ◽  
Strong Metric Dimension ◽  
Corona Product

scholarly journals Metric and upper dimension of zero divisor graphs associated to commutative rings

2020 ◽  
Vol 12 (1) ◽  
pp. 84-101 ◽  
Author(s):  
S. Pirzada ◽  
M. Aijaz
Keyword(s):  
Commutative Ring ◽  
Zero Divisor ◽  
Commutative Rings ◽  
Metric Dimension ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Vertex Set ◽  
Finite Commutative Rings

AbstractLet R be a commutative ring with Z*(R) as the set of non-zero zero divisors. The zero divisor graph of R, denoted by Γ(R), is the graph whose vertex set is Z*(R), where two distinct vertices x and y are adjacent if and only if xy = 0. In this paper, we investigate the metric dimension dim(Γ(R)) and upper dimension dim+(Γ(R)) of zero divisor graphs of commutative rings. For zero divisor graphs Γ(R) associated to finite commutative rings R with unity 1 ≠ 0, we conjecture that dim+(Γ(R)) = dim(Γ(R)), with one exception that {\rm{R}} \cong \Pi {\rm\mathbb{Z}}_2^{\rm{n}}, n ≥ 4. We prove that this conjecture is true for several classes of rings. We also provide combinatorial formulae for computing the metric and upper dimension of zero divisor graphs of certain classes of commutative rings besides giving bounds for the upper dimension of zero divisor graphs of rings.

scholarly journals Computing strong metric dimension of some special classes of graphs by genetic algorithms

2008 ◽  
Vol 18 (2) ◽  
pp. 143-151 ◽  
Author(s):  
Jozef Kratica ◽  
Vera Kovacevic-Vujcic ◽  
Mirjana Cangalovic
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Graph Coloring ◽  
Crew Scheduling ◽  
Metric Dimension ◽  
Hard Problem ◽  
Genetic Operators ◽  
Strong Metric Dimension ◽  
Np Hard Problem ◽  
Special Classes

In this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses binary encoding and standard genetic operators adapted to the problem. This represents the first attempt to solve this problem heuristically. We report experimental results for the two special classes of ORLIB test instances: crew scheduling and graph coloring.

Sign in / Sign up

Export Citation Format

Share Document