Results 11 to 20 of about 601,964 (234)
Metric dimension, doubly resolving set and strong metric dimension for $(C_n\Box P_k)\Box P_m$
arXiv admin note: substantial text overlap with arXiv:2103 ...
Liu, Jia-Bao, Zafari, Ali
openaire +2 more sources
General $d$-position sets [PDF]
The general $d$-position number ${\rm 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$.
Klavzar, Sandi +2 more
core +2 more sources
Controls on Wintertime Ventilation in Southern Drake Passage
Drake Passage is a key region for transport between the surface and interior ocean, but a mechanistic understanding of this exchange remains immature.
Lilian A. Dove +5 more
doaj +1 more source
Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
We consider the problem of determining the cardinality ?(H2,k) of minimal doubly resolving sets of Hamming graphs H2,k. We prove that for k ? 6 every minimal resolving set of H2,k is also a doubly resolving set, and, consequently, ?(H2,k) is equal to the metric dimension of H2,k, which is known from the literature.
Jozef Kratica +3 more
openaire +3 more sources
Transcriptome-mining for single-copy nuclear markers in ferns. [PDF]
BACKGROUND:Molecular phylogenetic investigations have revolutionized our understanding of the evolutionary history of ferns-the second-most species-rich major group of vascular plants, and the sister clade to seed plants.
Carl J Rothfels +11 more
doaj +1 more source
On the Metric Dimension of Cartesian Products of Graphs [PDF]
A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G.
Brigham R. C. +27 more
core +5 more sources
Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring [PDF]
Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP.
Marco De Bortoli
doaj +1 more source
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]
The \emph{zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)-S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule":
A Sebö +19 more
core +1 more source
Idealized cloud-resolving simulations of land-atmosphere coupling over tropical islands
This study investigates the impact of land-atmosphere coupling (LAC) over tropical islands using a Vector-Vorticity equation cloud-resolving Model (VVM).
Chien-Ming Wu Po-Yen Chen
doaj +1 more source
On the strong metric dimension of the strong products of graphs
Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u.
Kuziak Dorota +2 more
doaj +1 more source

