Results 71 to 80 of about 7,194,939 (348)
Fast algorithms for min independent dominating set
, 2009 We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm
D.S. Johnson +9 more
core +2 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 distanc es from the elements of S , and the minimum cardinality of such a set is called the metri c-location- domination number.
González, Antonio +2 more
core +3 more sources
On redundant locating-dominating sets
Discrete Applied Mathematics, 2023 A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We explore a fault-tolerant variant of locating-dominating sets called redundant locating-dominating sets, which can ...
Devin C. Jean, Suk J. Seo
openaire +2 more sources
A Linear Kernel for Planar Total Dominating Set
, 2018 A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Garnero, Valentin, Sau, Ignasi
core +1 more source
Population Ecology, EarlyView.This study examines the demographic dynamics of two seabird populations on Tromelin Island, 15 years after the eradication of brown rats. The results indicate that these populations are in good health and are expected to continue growing until breeding sites are saturated in about a century.
Merlène Saunier +6 more
wiley +1 more source
Proper 3-Dominating Sets in Graphs
MathematicsA dominating set is a classic concept that is widely used in road safety, disaster rescue operations, and chemical graphs. In this paper, we introduce a variation of the dominating set: the proper 3-dominating set.
Danmei Chen, Shuangjie Cai
doaj +1 more source
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 +2 more sources
On the number of minimum dominating sets and total dominating sets in forests
Journal of Graph TheoryAbstractWe show that the maximum number of minimum dominating sets of a forest with domination number is at most and construct for each a tree with domination number that has more than minimum dominating sets. Furthermore, we disprove a conjecture about the number of minimum total dominating sets in forests by Henning, Mohr and Rautenbach.
Jan Petr, Julien Portier, Leo Versteegen
openaire +3 more sources
The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada
Population Ecology, EarlyView.We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley +1 more source
Edge Dominating Sets and Vertex Covers
Discussiones Mathematicae Graph Theory, 2013 Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering ...
Dutton Ronald, Klostermeyer William F.
doaj +1 more source