Results 241 to 250 of about 423,616 (265)

On strong metric dimension of graphs and their complements

Acta Mathematica Sinica, English Series, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eunjeong Yi
openaire   +3 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.
Manuel, Paul, Rajan, Bharati, Grigorious, Cyriac, Stephen, Sudeep   +3 more
openaire   +4 more sources

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

Metric and strong metric dimension in intersection power graphs of finite groups

Communications in Algebra
Xuanlong Ma, Ruiqin Fu
openaire   +3 more sources

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

Metric and strong metric dimension in commuting graphs of finite groups

Communications in Algebra, 2022
Liangliang Zhai, Xuanlong Ma, Yong Shao, Guo Zhong   +3 more
openaire   +1 more source

On Strong Metric Dimension of Diametrically Vertex Uniform Graphs

INTERNATIONAL JOURNAL OF COMPUTING ALGORITHM, 2014
A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W⊆V, is said to be a strong metric generator if for all pairs u, v ∈/ W, there exist some element s ∈ W such that s strongly resolves the pair u, v.
openaire   +1 more source

On strong metric dimension of certain interconnection networks

AIP Conference Proceedings, 2023
Krishnan Sathish, Harinathan Prathab
openaire   +1 more source

Strong metric dimension of clean graphs of commutative rings

Journal of Algebra and Its Applications
Let [Formula: see text] be a ring with unity. The clean graph [Formula: see text] of a ring [Formula: see text] is the simple undirected graph whose vertices are of the form [Formula: see text], where [Formula: see text] is an idempotent element and [Formula: see text] is a unit of the ring [Formula: see text], and two vertices [Formula: see text ...
Praveen Mathil, Jitender Kumar
openaire   +1 more source