Results 71 to 80 of about 896 (158)
The Disjoint Domination Game [PDF]
, 2014 We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices.
Bujtás, Csilla, Tuza, Zsolt
core
Approximation Algorithms for Connected Maximum Cut and Related Problems
, 2015 An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S $\subseteq$ V that maximizes the number of edges in the cut \delta(S) such that the induced graph G[S] is connected.
C. Chekuri +11 more
core +1 more source
On global location-domination in graphs [PDF]
, 2013 A dominating set $S$ of a graph $G$ is called locating-dominating, LD-set for short, if every vertex $v$ not in $S$ is uniquely determined by the set of neighbors of $v$ belonging to $S$.
Hernando, C., Mora, M., Pelayo, I. M.
core +1 more source
Signed domatic number of a graph
Discrete Applied Mathematics, 2005 Given a graph \(G=(V, E)\), the signed dominating function is a two-valued mapping \(f : V \rightarrow \{-1, 1\}\) such that, for each vertex \(v\in V\), \(\sum_{x\in N[v]} f(x) \geq 1\), where \(N[v]=N(v)\cup\{v\}\) is the closed neighborhood of \(v\).
Volkmann, Lutz, Zelinka, Bohdan
openaire +2 more sources
Domination parameters with number 2: interrelations and algorithmic consequences
, 2016 In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak $2$-domination
Bonomo, Flavia +4 more
core
Restricted Strip Covering and the Sensor Cover Problem
, 2006 Given a set of objects with durations (jobs) that cover a base region, can we schedule the jobs to maximize the duration the original region remains covered? We call this problem the sensor cover problem.
Buchsbaum, Adam L. +4 more
core +2 more sources
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime. [PDF]
Sensors (Basel), 2022 Bouamama S, Blum C, Pinacho-Davidson P.
europepmc +1 more source
Deploying robots with two sensors in $K_{1,6}$-free graphs
, 2014 Let $G$ be a graph of minimum degree at least two with no induced subgraph isomorphic to $K_{1,6}$. We prove that if $G$ is not isomorphic to one of eight exceptional graphs, then it is possible to assign two-element subsets of $\{1,2,3,4,5\}$ to the ...
Abbas, Waseem +4 more
core
Two-out degree equitable domination in graphs [PDF]
Transactions on Combinatorics, 2013 An equitable domination has interesting application in the contextof social networks. In a network, nodes with nearly equal capacitymay interact with each other in a better way. In the societypersons with nearly equal status, tend to be friendly.
Ali Sahal, Veena Mathad
doaj
Distance domatic numbers for grid graphs
, 2019 We say that a vertex-coloring of a graph is a proper k-distance domatic coloring if for each color, every vertex is within distance k from a vertex receiving that color. The maximum number of colors for which such a coloring exists is called the k-distance domatic number of the graph.
Cameron, Alex, Yan, Jiasheng
openaire +2 more sources