Results 11 to 20 of about 48,502 (244)
Mathematics, 2020 We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph.
Ismael González Yero
doaj +3 more sources
The dominant strong metric dimension of graphs
AKCE International Journal of Graphs and CombinatoricsGraphs are useful for analyzing the structure models in computer science, operations research, and sociology. Also, different types of graph products have several applications in modeling, including those found in network analysis, communication ...
M. Valiyanpour +2 more
doaj +2 more sources
Comparing Two Novel LiDAR‐Based Indices for Quantifying Forest Structural Complexity [PDF]
Ecology and EvolutionForest structural complexity is critical for ecosystem functions, yet standardized metrics for its quantification remain elusive. This study compares two LiDAR‐derived three‐dimensional indices, the box dimension (Db) as a fractal‐based measure, and ...
Tillman Reuter +2 more
doaj +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.
Sudeep Stephen +2 more
exaly +5 more sources
The Simultaneous Strong Metric Dimension of Graph Families
Bulletin of the Malaysian Mathematical Sciences Society, 2015 Let ${\cal G}$ be a family of graphs defined on a common (labeled) vertex set $V$. A set $S\subset V$ is said to be a simultaneous strong metric generator for ${\cal G}$ if it is a strong metric generator for every graph of the family. The minimum cardinality among all simultaneous strong metric generators for ${\cal G}$, denoted by $Sd_s({\cal G ...
Alejandro Estrada-Moreno +2 more
exaly +3 more sources
On the strong metric dimension of Cartesian and direct products of graphs
Discrete Mathematics, 2014 17 ...
Dorota Kuziak +2 more
exaly +4 more sources
On optimal approximability results for computing the strong metric dimension
Discrete Applied Mathematics, 2017 revised version based on reviewer comments; to appear in Discrete Applied ...
Bhaskar Dasgupta, Nasim Mobasheri
exaly +3 more sources
On the strong metric dimension of corona product graphs and join graphs
Discrete Applied Mathematics, 2013 Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving set for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $W$.
Dorota Kuziak +2 more
exaly +5 more sources
Variable neighborhood search for the strong metric dimension problem
Electronic Notes in Discrete Mathematics, 2012 Abstract We consider a variable neighborhood search approach for solving the strong metric dimension problem. The proposed method is based on the idea of decomposition and it is characterized by suitably chosen neighborhood structures and efficient local search.
Nenad Mladenovic +2 more
exaly +2 more sources
On the strong metric dimension of composed graphs
CoRR, 2022 Two vertices $u$ and $v$ of an undirected graph $G$ are strongly resolved by a vertex $w$ if there is a shortest path between $w$ and $u$ containing $v$ or a shortest path between $w$ and $v$ containing $u$. A vertex set $R$ is a strong resolving set for $G$ if for each pair of vertices there is a vertex in $R$ that strongly resolves them.
Marcel Wagner +2 more
openaire +2 more sources