Results 251 to 260 of about 772,522 (267)

Metric dimension and strong metric dimension in annihilator-ideal graphs

Applicable Algebra in Engineering, Communication and Computing
R. Shahriyari, R. Nikandish, Abolfazl Tehranian, H. Rasouli   +3 more
semanticscholar   +2 more sources

On the Strong Metric Dimension of Annihilator Graphs of Commutative Rings

Bulletin of the Malaysian Mathematical Sciences Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shayesteh Ebrahimi, R. Nikandish, A. Tehranian, Hassan Rasouli   +3 more
semanticscholar   +3 more sources

On Strong Metric Dimension of Cubic Carbon Crystal

International Journal of Applied and Computational Mathematics
Malkesh Singh, S. Sharma, Vijay Kumar Bhat   +2 more
semanticscholar   +2 more sources

Fault-tolerant strong metric dimension of graphs

Discrete Mathematics, Algorithms and Applications, 2022
In this paper, we introduce a variant of strong metric dimension, called the fault-tolerant strong metric dimension. A strong resolving set [Formula: see text] for [Formula: see text] is fault-tolerant if [Formula: see text] is also a strong resolving set, for each [Formula: see text] in [Formula: see text], and the fault-tolerant strong metric ...
Sathish Krishnan, Bharati Rajan
openaire   +2 more sources

On the Strong Metric Dimension of Tetrahedral Diamond Lattice

Mathematics in Computer Science, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Manuel, Bharati Rajan, Cyriac Grigorious, Sudeep Stephen   +3 more
semanticscholar   +5 more sources

ON THE STRONG METRIC DIMENSION OF A TOTAL GRAPH OF NONZERO ANNIHILATING IDEALS

Bulletin of the Australian Mathematical Society, 2021
Let R be a commutative ring with identity which is not an integral domain. An ideal I of R is called an annihilating ideal if there exists $r\in R- \{0\}$ such that $Ir=(0)$ . The total graph of nonzero annihilating ideals of R is the graph $\Omega (
N. Abachi, M. Adlifard, M. Bakhtyiari
semanticscholar   +1 more source

On Strong Metric Dimension of the Methane Molecular Graph Using Resolving Sets

Journal of Physics: Conference Series
In graph theory, a graph’s strong metric dimension is a crucial quantity that has applications in molecular chemistry, network architecture, and navigation systems.
P. Tharaniya, R.Ambrose Prabhu, R. Ravikumar, R. Rajalakshmi, G. Prabhu   +4 more
semanticscholar   +1 more source

On the Strong Metric Dimension of Certain Nanostructures

Journal of Computational and Theoretical Nanoscience, 2017
Let G(V, E) be a connected graph. A vertex w strongly resolves a pair of vertices u,v in V if there exists some shortestu–w path containing V or some shortest v–w path containing u. A set w ⊂ V of vertices is called a strong resolving set for G if every pair of vertices of V\W is strongly resolved by some vertex of w .
Sathish Krishnan, Bharati Rajan, Muhammad Imran   +2 more
openaire   +1 more source

On the strong metric dimension of the zero-divisor graph of a lattice

Indian journal of pure and applied mathematics
In this paper, the generalized blow-up of a Boolean lattice $L\cong \textbf{2}^n$ using finite chains is introduced. Also, we compute the strong metric dimension of the zero-divisor graph of the blow-up of a Boolean lattice.
Pravin Gadge, Vinayak Joshi
semanticscholar   +1 more source

The Fractional Strong Metric Dimension of Graphs

2013
For any two vertices x and y of a graph G, let S{x, y} denote the set of vertices z such that either x lies on a y − z geodesic or y lies on a x − z geodesic. For a function g defined on V(G) and U ⊆ V(G), let g(U) = ∑ x ∈ Ug(x). A function g: V(G) → [0,1] is a strong resolving function of G if g(S{x, y}) ≥ 1, for every pair of distinct vertices x, y ...
Cong X. Kang, Eunjeong Yi
openaire   +1 more source