Jan 28, 2017 · ... the strong metric dimension of Sierpi´nski graphs with. pendant vertices. 1The diameter of G= (V, E ) is defined as D(G) = maxu,v∈V{d(u, v) ...
Abstract. Let G be a connected graph of order n having ε(G) end-vertices. Given a positive integer t, we denote by S(G, t) the t-th generalized Sierpinski ...
People also ask
What is the strong metric dimension of a graph?
What is on the metric dimension of a graph?
The strong metric dimension of generalized Sierpinski graphs with pendant vertices. Ars Mathematica Contemporanea, 12(1), 127-134. DOI: 10.26493/1855 ...
Let G be a connected graph of order n having ?(G) end-vertices. Given a positive integer t, we denote by S(G; t) the t-Th generalized Sierpínski graph of G.
TL;DR: In this paper, the distance between an arbitrary vertex and an almost-extreme vertex in Sierpinski graphs has been investigated, where an almost extreme ...
Estaji, Ehsan, Rodríguez-Velázquez, Juan Alberto. "The strong metric dimension of generalized Sierpiński graphs with pendant vertices." Ars mathematica ...
The minimum number of vertices performing the geodesic identification for each pair of vertices in G is called the strong metric dimension of G . In this paper, ...
Aug 15, 2019 · The strong metric dimension of generalized Sierpiński graphs with pendant vertices. Ars Math. Contemp., 12 (2017), pp. 127-134. View in Scopus ...
Metric dimension is a measure of how efficiently one can locate and distinguish between the vertices (nodes) of a graph using a minimal set of landmarks or ...
The strong metric dimension of generalized Sierpiński graphs with pendant vertices · E. EstajiJ. A. Rodríguez-Velázquez. Mathematics. Ars Math. Contemp. 2017.