Reports de recerca
Recent Submissions

Locating domination in bipartite graphs and their complements
(20171103)
External 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 locatingdominating set of G is a dominating distinguishing set. The locationdomination ... 
Metriclocatingdominating partitions in graphs
(20171103)
External research report
Open AccessA partition ¿ = { S 1 ,...,S k } of the vertex set of a connected graph G is a metriclocating 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
(20171016)
External 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 2broadcasts along with the ... 
From subKautz digraphs to cyclic Kautz digraphs
(2017)
External research report
Open AccessKautz digraphs K(d,l) are a wellknown family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, ... 
On quotient digraphs and voltage digraphs
(2016)
External research report
Open AccessIn this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line ... 
Connected and internal graph searching
(200207)
External research report
Open AccessThis paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs. It ... 
General bounds on limited broadcast domination
(20160919)
External 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 ... 
Symmetry breaking in tournaments
(2010)
External research report
Open AccessWe provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, ... 
On the Partition Dimension and the Twin Number of a Graph
(20160305)
External 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)
External 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
(20150529)
External research report
Open Access 
On global locationdomination in bipartite graphs
(20150610)
External research report
Open Access