Results 31 to 40 of about 14,788 (226)
The Forcing Strong Metric Dimension of a Graph [PDF]
, 2017 For any two vertices u, v in a connected graph G, the interval I(u, v) consists of all vertices which are lying in some u − v shortest path in G. A vertex x in a graph G strongly resolves a pair of vertices u, v if either u ∈ I(x, v) or v ∈ I(x, u).
Baca, Martin, Lenin, R, Kathiresan, KM
core +2 more sources
Graph-based Data Integration for System Integrity and Scalable Analytics [PDF]
, 2022 Data from heterogeneous sources need to be brought together for numerous purposes ranging from data consolidation, reporting, and analytics to long-term preservation. The bringing about of these data sources is commonly known as data integration.
Arshad, B.
core +1 more source
Enumerating minimal solution sets for metric graph problems [PDF]
, 2023 31 pages, 2 figuresInternational audienceProblems from metric graph theory such as Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had a strong impact on the field of parameterized complexity by being the first problems in NP to
Bergougnoux, Benjamin +2 more
core +1 more source
The fractional strong metric dimension in three graph products [PDF]
, 2016 For any two distinct vertices $x$ and $y$ of a graph $G$, let $S\{x, y\}$ denote the set of vertices $z$ such that either $x$ lies on a $y-z$ geodesic or $y$ lies on an $x-z$ geodesic.
Yi, Eunjeong +2 more
core +2 more sources
The minimum number of some resolving sets for the Crystal Cubic Carbon CCC(n) and the Layer Cycle Graph LCG(n, k) [PDF]
, 2023 The problem of determining resolving sets in graph theory has a long history, as it has many applications in chemistry, robot navigation, combinatorial optimization and utilization of the idea in pattern recognition and processing of images that also ...
Liu, Jia-Bao, Zafari, Ali
core +1 more source
The strong metric dimension of graphs and digraphs [PDF]
, 2007 Let G be a connected (di)graph. A vertex w is said to strongly resolve 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.
Peters-Fransen, Joel +1 more
core +1 more source
The fault-tolerant metric dimension of the king’s graph [PDF]
, 2017 The concept of resolving the set within a graph is related to the optimal placement problem of access points in an indoor positioning system. A vertex w of the undirected connected graph G resolves the vertices u and v of G if the distance between ...
Voronov, Roman V.
core +1 more source
On the Strong Metric Dimension of Certain Nanostructures [PDF]
, 2017 Let G(V, E) be a connected graph. A vertex w strongly resolves a pair of vertices u,v in V if there exists some shortestu–w path containing V or some shortest v–w path containing u. A set w ⊂ V of vertices is called a strong resolving set for G if every
Bharati Rajan +2 more
core +1 more source
, 2021 The general d-position number gp(d)(G) of a graph G is the cardinality of a largest set S for which no three distinct vertices from S lie on a common geodesic of length at most d.
González Yero, Ismael +2 more
core +1 more source
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source