Results 11 to 20 of about 84,964 (255)
On the fractional metric dimension of graphs
Discrete Applied Mathematics, 2014 In [S. Arumugam, V. Mathew and J. Shen, On fractional metric dimension of graphs, preprint], Arumugam et al. studied the fractional metric dimension of the cartesian product of two graphs, and proposed four open problems. In this paper, we determine the fractional metric dimension of vertex-transitive graphs, in particular, the fractional metric ...
Min Feng
exaly +4 more sources
Metric Dimension Parameterized By Treewidth [PDF]
Algorithmica, 2021 AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer.
Édouard Bonnet, Nidhi Purohit
openaire +6 more sources
On metric dimensions of hypercubes
Ars Mathematica Contemporanea, 2022 The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by using a vector of distances to this set. In this note we show two unexpected results on hypercube graphs. First, we
Aleksander Kelenc +3 more
openaire +5 more sources
ON METRIC DIMENSION OF FUNCTIGRAPHS [PDF]
Discrete Mathematics, Algorithms and Applications, 2013 The metric dimension of a graph G, denoted by dim (G), is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let G1and G2be disjoint copies of a graph G and let f : V(G1) → V(G2) be a function. Then a functigraphC(G, f) = (V, E) has the vertex set V = V(G1) ∪ V(G2) and the edge set E = E(
Linda Eroh, Cong X. Kang, Eunjeong Yi
openaire +2 more sources
Graphs of Neighborhood Metric Dimension Two
Journal of Mathematical and Fundamental Sciences, 2021 A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the union of subgraphs of G induced by the closed neighbors of elements in S. Further, a set S is a resolving set of G if for each pair of distinct vertices x,y
Badekara Sooryanarayana +1 more
doaj +1 more source
Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs
Mathematics, 2022 The vertex (respectively edge) metric dimension of a graph G is the size of a smallest vertex set in G, which distinguishes all pairs of vertices (respectively edges) in G, and it is denoted by dim(G) (respectively edim(G)). The upper bounds dim(G)≤2c(G)−
Martin Knor +2 more
doaj +1 more source
On Mixed Metric Dimension of Rotationally Symmetric Graphs
IEEE Access, 2020 A vertex u ∈ V(G) resolves (distinguish or recognize) two elements (vertices or edges) v, w ∈ E(G)UV(G) if dG(u, v) ≠ dG(u, w) . A subset Lm of vertices in a connected graph G is called a mixed metric generator for G if every two ...
Hassan Raza, Jia-Bao Liu, Shaojian Qu
doaj +1 more source
On Mixed Metric Dimension of Some Path Related Graphs
IEEE Access, 2020 A vertex $k\in V_{G}$ determined two elements (vertices or edges) $\ell,m \in V_{G}\cup E_{G}$ , if $d_{G}(k,\ell)\neq d_{G}(k,m)$ . A set $R_ {\text {m}}$ of vertices in a graph $G$ is a mixed metric generator for $G$ , if two distinct elements
Hassan Raza, Ying Ji, Shaojian Qu
doaj +1 more source
Sequential Metric Dimension [PDF]
Algorithmica, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien +4 more
openaire +5 more sources
Metric and Fault-Tolerant Metric Dimension of Hollow Coronoid
IEEE Access, 2021 Coronoid systems actually arrangements of hexagons into six sides of benzenoids. By nature, it is an organic chemical structure. Hollow coronoids are primitive and catacondensed coronoids. It is also known as polycyclic conjugated hydrocarbons.
Ali N. A. Koam +3 more
doaj +1 more source