Results 251 to 260 of about 22,588 (272)
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 +2 more sources
Investigating the metric and edge metric dimensions of H-naphthalenic nanotubes
Journal of Discrete Mathematical Sciences and CryptographyIf 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 +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Edge metric dimension and mixed metric dimension of a plane graph Tn
Discrete Mathematics, Algorithms and Applications, 2023Let [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].
Huige Shen, Jing Qu, Na Kang, Cong Lin
openaire +1 more source
Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph
Mathematics, 2018 Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively.
Jia-Bao Liu +2 more
exaly +2 more sources
On Approximation Algorithm for the Edge Metric Dimension Problem
Theoretical Computer Science, 2019This 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.
Yufei Huang 0010 +5 more
openaire +2 more sources
Computing edge version of metric and double metric dimensions of Kayak paddle graphs
Discrete Mathematics, Algorithms and Applications, 2020Locating 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 ...
Muhammad Ahmad 0003 +3 more
openaire +1 more source
The metric dimension of graph with pendant edges
2008Summary: For an ordered set \(W = \{w_1,w_2,\dots,w_k\}\) of vertices and a vertex \(v\) in a connected graph \(G\), the representation of \(v\) with respect to \(W\) is the ordered \(k\)-tuple \(r(vlW) = (d(v, w_1),d(v,w_1),\dots,d(v,w_k))\) where \(d(x,y)\) represents the distance between tKe vertices \(x\) and \(y\).
Iswadi, Hazrul +3 more
openaire +1 more source
The K-edge metric dimension of a graph
Discrete Mathematics, Algorithms and ApplicationsThe main advantage of the edge metric basis in the detection problem is that it identifies every distinct pair of edges in a simple connected graph [Formula: see text] by placing detectors at selected vertices. However, if one detector fails, the entire system breaks down.
Nosheen Goshi +2 more
openaire +1 more source
The complement edge metric dimension of graphs
AIP Conference Proceedings, 2022Nirmala Mega Rosyidah, null Rinurwati
openaire +1 more source