Buscar
Mostrando ítems 1-10 de 43912
Domination parameters with number 2: Interrelations and algorithmic consequences
(Elsevier Science, 2018-01)
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 ...
On the complexity of the labeled domination problem in graphs
(Blackwell Publishers, 2017-01)
In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination, {k} -domination, and M-domination, among others) was introduced. The labeled domination problem is to find an L-dominating ...
Dominant-non-dominant asymmetry of kicking a stationary and rolling ball in a futsal context
(2015)
The aim of this study was to analyse the characteristics of the asymmetries in the dominant and non-dominant limbs when kicking stationary and rolling balls. Ten experienced Brazilian amateur futsal players participated ...
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
(Elsevier, 2019)
The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all ...
On the complexity of { k } -domination and k-tuple domination in graphs
(Elsevier Science, 2015-06)
We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision ...
Improved algorithms for k-domination and total k-domination in proper interval graphs
(Springer, 2018-07)
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total dominating ...
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
(Elsevier Science, 2019-11)
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set is a set of vertices such that every ...
Efficient and Perfect domination on circular-arc graphs
(Elsevier, 2015-12)
Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each vertex v ∈ V (G) \ V is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V ...