Results 11 to 20 of about 604,199 (244)

Further new results on strong resolving partitions for graphs

Open Mathematics, 2020
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj   +2 more sources

The general position problem and strong resolving graphs

Open Mathematics, 2019
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj   +3 more sources

Metric dimension, doubly resolving set and strong metric dimension for $(C_n\Box P_k)\Box P_m$

, 2021
arXiv admin note: substantial text overlap with arXiv:2103 ...
Liu, Jia-Bao, Zafari, Ali
openaire   +2 more sources

General $d$-position sets [PDF]

, 2020
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, Rall, Douglas F., Yero, Ismael G.   +2 more
core   +2 more sources

Minimal doubly resolving sets and the strong metric dimension of Hamming graphs

Applicable Analysis and Discrete Mathematics, 2012
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, Vera Kovacevic-Vujcic, Mirjana Cangalovic, Milica Stojanovic   +3 more
openaire   +3 more sources

Controls on Wintertime Ventilation in Southern Drake Passage

Geophysical Research Letters, 2023
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, Giuliana A. Viglione, Andrew F. Thompson, M. Mar Flexas, Taylor R. Cason, Janet Sprintall   +5 more
doaj   +1 more source

On the Metric Dimension of Cartesian Products of Graphs [PDF]

, 2005
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., Carlos Seara, Carmen Hernando, Chartrand G., Chartrand G., Currie J., David R. Wood, Erdo˝s P., Goddard W., Goddard W., Greenwell D. L., Harary F., Ignacio M. Pelayo, José Cáceres, Knuth D. E., Lindström B., Lindström B., María L. Puertas, Mercè Mora, Peters‐Fransen J., Poisson C., Saenpholphat V., Shanmukha B., Slater P. J., Slater P. J., Sooryanarayana B., Sooryanarayana B., Yushmanov S. V.   +27 more
core   +5 more sources

Transcriptome-mining for single-copy nuclear markers in ferns. [PDF]

PLoS ONE, 2013
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, Anders Larsson, Fay-Wei Li, Erin M Sigel, Layne Huiet, Dylan O Burge, Markus Ruhsam, Sean W Graham, Dennis W Stevenson, Gane Ka-Shu Wong, Petra Korall, Kathleen M Pryer   +11 more
doaj   +1 more source

A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]

, 2014
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ö, CJ Edholm, CX Kang, CX Kang, D Burgarth, D Burgarth, DD Row, E Yi, F Barioli, F Barioli, F Harary, G Chartrand, K Chilakamarri, L Eroh, L Hogben, MR Garey, OR Oellermann, PJ Slater, S Khuller, S Severini   +19 more
core   +1 more source

Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring [PDF]

Electronic Proceedings in Theoretical Computer Science, 2019
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