Reports de recerca
Recent Submissions
-
Locating domination in bipartite graphs and their complements
(2017-11-03)
Research report
Open AccessA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Metric-locating-dominating partitions in graphs
(2017-11-03)
Research report
Open AccessA partition ¿ = { S 1 ,...,S k } of the vertex set of a connected graph G is a metric-locating partition of G if for every pair of vertices u,v belonging to the same part S i , d ( u,S j ) 6 = d ( v,S j ), for some other ... -
Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs
(2017-10-16)
Research report
Open AccessLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ... -
The Plogi and ACi-1 operators on the polynomial time hierarchy
(1993-11)
Research report
Open AccessIn a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ... -
General bounds on limited broadcast domination
(2016-09-19)
Research report
Open AccessLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ... -
New results on metric-locating-dominating sets of graphs
(2016-04-13)
Research report
Open AccessA 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 ... -
On the Partition Dimension and the Twin Number of a Graph
(2016-03-05)
Research report
Open AccessA partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum ... -
On cyclic Kautz digraphs
(2015)
Research report
Open AccessA prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given ... -
Perfect anda quasiperfect domination in trees
(2015-05-29)
Research report
Open Access -
On global location-domination in bipartite graphs
(2015-06-10)
Research report
Open Access -
On perfect and quasiperfect domination in graphs
(2014-11-28)
Research report
Open Access -
Global location-domination in graphs
(2013-12-03)
Research report
Open AccessA dominating set S of a graph G is called locating-dominating, LD-setfor short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ...
RSS 1.0