Results 241 to 250 of about 254,578 (267)

On graphs with the maximum edge metric dimension

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enqiang Zhu   +3 more
openaire   +3 more sources

Edge metric dimension and mixed metric dimension of a plane graph Tn

Discrete Mathematics, Algorithms and Applications, 2023
Let [Formula: see text] be a connected graph where [Formula: see text] is the set of vertices of [Formula: see text] and [Formula: see text] is the set of edges of [Formula: see text]. The distance from the vertex [Formula: see text] to the edge [Formula: see text] is given by [Formula: see text].
Shen, Huige   +3 more
openaire   +1 more source

ON METRIC DIMENSION OF EDGE-CORONA GRAPHS

Far East Journal of Mathematical Sciences (FJMS), 2017
Far East Journal of Mathematical Sciences (FJMS), Volume 102, Number 5, 2017, Pages 965 ...
null Rinurwati   +2 more
openaire   +1 more source

On Approximation Algorithm for the Edge Metric Dimension Problem

Theoretical Computer Science, 2019
This article studies the concept of edge metric dimension. One can define the edge metric dimension as the smallest size of a vertex subset of a graph such that, for each pair of edges in the graph, there is a vertex in the subset which ``distinguishes'' the edges.
Huang, Yufei   +5 more
openaire   +2 more sources

Computing edge version of metric and double metric dimensions of Kayak paddle graphs

Discrete Mathematics, Algorithms and Applications, 2020
Locating the source of diffusion in complex networks is an exciting but challenging task. It is critical for preventing and controlling the epidemic risks. Source localization has been studied under many feasible models. In this paper, we discuss the localization problem in Kayak paddle graphs [Formula: see text] for [Formula: see text] and [Formula ...
Ahmad, Muhammad   +3 more
openaire   +1 more source

Edge metric dimension of fullerenes

2023
Bonyabadilrm;, Parvane   +3 more
openaire   +1 more source

Investigating the metric and edge metric dimensions of H-naphthalenic nanotubes

Journal of Discrete Mathematical Sciences and Cryptography
If the distances between two vertices in a simple connected network are different, then a vertex x resolves the pair u and v. A set S of vertices in G is referred to as a resolving set if every pair of distinct vertices in G can be identified by at least one vertex in S.
Faryal Chaudhry   +7 more
openaire   +1 more source

Home - About - Disclaimer - Privacy