Results 11 to 20 of about 49,728 (201)
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj +1 more source
Localization game on geometric and planar graphs [PDF]
, 2017 The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph $G$ we want to localize a walking agent by checking his distance to as few vertices as possible.
Bosek, Bartłomiej +5 more
core +3 more sources
Bounding the Locating-Total Domination Number of a Tree in Terms of Its Annihilation Number
Discussiones Mathematicae Graph Theory, 2019 Suppose G = (V,E) is a graph with no isolated vertex. A subset S of V is called a locating-total dominating set of G if every vertex in V is adjacent to a vertex in S, and for every pair of distinct vertices u and v in V −S, we have N(u) ∩ S ≠ N(v) ∩ S ...
Ning Wenjie, Lu Mei, Wang Kun
doaj +1 more source
Locating regions in a sequence under density constraints [PDF]
, 2013 Several biological problems require the identification of regions in a sequence where some feature occurs within a target density range: examples including the location of GC-rich regions, identification of CpG islands, and sequence matching ...
Benjamin A. Burton +5 more
core +3 more sources
Centroidal bases in graphs [PDF]
, 2014 We introduce the notion of a centroidal locating set of a graph $G$, that is, a set $L$ of vertices such that all vertices in $G$ are uniquely determined by their relative distances to the vertices of $L$. A centroidal locating set of $G$ of minimum size
Foucaud, Florent +2 more
core +6 more sources
New results on metric-locating-dominating sets of graphs [PDF]
, 2016 A dominating set $S$ of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of $S$, and the minimum cardinality of such a set is called the metric-location-domination number.
González, Antonio +2 more
core +3 more sources
Location-domination in line graphs
, 2016 A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \cap D \neq N(v) \cap D$, where $N(u)$ denotes the open neighborhood
Foucaud, Florent, Henning, Michael A.
core +3 more sources
Crumpled triangulations and critical points in 4D simplicial quantum gravity [PDF]
, 1998 This is an expanded and revised version of our geometrical analysis of the strong coupling phase of 4D simplicial quantum gravity. The main differences with respect to the former version is a full discussion of singular triangulations with singular ...
A. Marzuoli +27 more
core +2 more sources
Open-independent, Open-locating-dominating Sets [PDF]
, 2017 A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any given "intruder" vertex in V(G).
Seo, S. J. (Suk), Slater, P. J. (Peter)
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Retinoblastoma (RB) is the most common pediatric ocular cancer, yet population‐based data on survival and risk factors remain limited. This study aimed to describe survival in a large national RB cohort and identify predictors of death and complications.
Samuel Sassine +14 more
wiley +1 more source