Reports de recerca
http://hdl.handle.net/2117/3198
Fri, 28 Apr 2017 10:27:04 GMT2017-04-28T10:27:04ZThe Plogi and ACi-1 operators on the polynomial time hierarchy
http://hdl.handle.net/2117/97278
The Plogi and ACi-1 operators on the polynomial time hierarchy
Castro Rabal, Jorge; Seara Ojea, Carlos
In 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, Pi_k^p, Delta_k^P and Theta_k^P-classes both operators have the same behaviour, but this coincidence does not seem to be true on other classes included in the PH hierarchy: we give a set A such that, relativized to A, P_{log^i}(P_{log^j}(NP)) is different from AC^{i-1}(P_{log^j}(NP)). As a result of these characterizations we show P_{log}(Theta_k^p) = Theta_k^p, an equality that is useful to show lowness properties. In fact, we get easily the Theta-lowness results given by Long and Sheu in their paper [LS-91]. Besides, we clarify the situation of the classes in L_2^{p,Delta} for which their membership to L_2^{p,Theta} was not clear.
Mon, 28 Nov 2016 09:01:43 GMThttp://hdl.handle.net/2117/972782016-11-28T09:01:43ZCastro Rabal, JorgeSeara Ojea, CarlosIn 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, Pi_k^p, Delta_k^P and Theta_k^P-classes both operators have the same behaviour, but this coincidence does not seem to be true on other classes included in the PH hierarchy: we give a set A such that, relativized to A, P_{log^i}(P_{log^j}(NP)) is different from AC^{i-1}(P_{log^j}(NP)). As a result of these characterizations we show P_{log}(Theta_k^p) = Theta_k^p, an equality that is useful to show lowness properties. In fact, we get easily the Theta-lowness results given by Long and Sheu in their paper [LS-91]. Besides, we clarify the situation of the classes in L_2^{p,Delta} for which their membership to L_2^{p,Theta} was not clear.General bounds on limited broadcast domination
http://hdl.handle.net/2117/96711
General bounds on limited broadcast domination
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José
Limited 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 number. We present a uni ed upper bound on this parameter for any value of k in terms of both k and the order of the graph. For the speci c case of the 2-broadcast dominating number, we show that this bound is tight for graphs as large as desired. We also study the family of caterpillars, providing a smaller upper bound, which is attained by a set of such graphs with unbounded order.
Wed, 16 Nov 2016 10:37:47 GMThttp://hdl.handle.net/2117/967112016-11-16T10:37:47ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelPuertas, Maria LuzCáceres, JoséLimited 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 number. We present a uni ed upper bound on this parameter for any value of k in terms of both k and the order of the graph. For the speci c case of the 2-broadcast dominating number, we show that this bound is tight for graphs as large as desired. We also study the family of caterpillars, providing a smaller upper bound, which is attained by a set of such graphs with unbounded order.New results on metric-locating-dominating sets of graphs
http://hdl.handle.net/2117/96709
New results on metric-locating-dominating sets of graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; González, Antonio
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. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominatin g sets to other special sets: resolving sets, dominating sets, locating-dominating set s and doubly resolving sets. We first characterize classes of trees according to cer tain relationships between their metric-location-domination number and thei r metric dimension and domination number. Then, we show different methods to tran sform metric- locating-dominating sets into locating-dominating sets a nd doubly resolving sets. Our methods produce new bounds on the minimum cardinalities of all those sets, some of them involving parameters that have not been related so far
Wed, 16 Nov 2016 10:25:27 GMThttp://hdl.handle.net/2117/967092016-11-16T10:25:27ZHernando Martín, María del CarmenMora Giné, MercèGonzález, AntonioA 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. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominatin g sets to other special sets: resolving sets, dominating sets, locating-dominating set s and doubly resolving sets. We first characterize classes of trees according to cer tain relationships between their metric-location-domination number and thei r metric dimension and domination number. Then, we show different methods to tran sform metric- locating-dominating sets into locating-dominating sets a nd doubly resolving sets. Our methods produce new bounds on the minimum cardinalities of all those sets, some of them involving parameters that have not been related so farOn the Partition Dimension and the Twin Number of a Graph
http://hdl.handle.net/2117/87267
On the Partition Dimension and the Twin Number of a Graph
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
A 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 cardinality of a locating partition of G . A pair of vertices u;v of a graph G are called twins if they have exactly the same set of neighbors other than u and v . A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G . In this paper we undertake the study of the partition dimension of a graph by also considering its twin number. This approach allows us to obtain the set of connected graphs of order n 9 having partition dimension n
Tue, 24 May 2016 10:33:18 GMThttp://hdl.handle.net/2117/872672016-05-24T10:33:18ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelA 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 cardinality of a locating partition of G . A pair of vertices u;v of a graph G are called twins if they have exactly the same set of neighbors other than u and v . A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G . In this paper we undertake the study of the partition dimension of a graph by also considering its twin number. This approach allows us to obtain the set of connected graphs of order n 9 having partition dimension nOn cyclic Kautz digraphs
http://hdl.handle.net/2117/80848
On cyclic Kautz digraphs
Böhmová, Katerina; Dalfó Simó, Cristina; Huemer, Clemens
A 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 the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d, `) and it is derived from the Kautz digraphs K(d, `). It is well-known that the Kautz digraphs K(d, `) have the smallest diameter among all digraphs with their number of vertices and degree. We define the cyclic Kautz digraphs
CK(d, `), whose vertices are labeled by all possible sequences a1 . . . a` of length `, such that each character ai is chosen from an alphabet containing d + 1 distinct symbols, where the consecutive characters in the sequence are different (as in Kautz digraphs), and now also requiring that a1 6= a`. The cyclic Kautz digraphs CK(d, `) have arcs between vertices a1a2 . . . a` and a2 . . . a`a`+1, with a1 6= a` and a2 6= a`+1. Unlike in Kautz digraphs K(d, `), any label of a vertex of CK(d, `) can be cyclically shifted to form again a label of a vertex of CK(d, `).
We give the main parameters of CK(d, `): number of vertices, number of arcs, and diameter.
Moreover, we construct the modified cyclic Kautz digraphs MCK(d, `) to obtain the same diameter as in the Kautz digraphs, and we show that MCK(d, `) are d-out-regular.
Finally, we compute the number of vertices of the iterated line digraphs of CK(d, `).
Thu, 17 Dec 2015 10:58:24 GMThttp://hdl.handle.net/2117/808482015-12-17T10:58:24ZBöhmová, KaterinaDalfó Simó, CristinaHuemer, ClemensA 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 the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d, `) and it is derived from the Kautz digraphs K(d, `). It is well-known that the Kautz digraphs K(d, `) have the smallest diameter among all digraphs with their number of vertices and degree. We define the cyclic Kautz digraphs
CK(d, `), whose vertices are labeled by all possible sequences a1 . . . a` of length `, such that each character ai is chosen from an alphabet containing d + 1 distinct symbols, where the consecutive characters in the sequence are different (as in Kautz digraphs), and now also requiring that a1 6= a`. The cyclic Kautz digraphs CK(d, `) have arcs between vertices a1a2 . . . a` and a2 . . . a`a`+1, with a1 6= a` and a2 6= a`+1. Unlike in Kautz digraphs K(d, `), any label of a vertex of CK(d, `) can be cyclically shifted to form again a label of a vertex of CK(d, `).
We give the main parameters of CK(d, `): number of vertices, number of arcs, and diameter.
Moreover, we construct the modified cyclic Kautz digraphs MCK(d, `) to obtain the same diameter as in the Kautz digraphs, and we show that MCK(d, `) are d-out-regular.
Finally, we compute the number of vertices of the iterated line digraphs of CK(d, `).Perfect anda quasiperfect domination in trees
http://hdl.handle.net/2117/77007
Perfect anda quasiperfect domination in trees
Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz
Tue, 22 Sep 2015 10:11:25 GMThttp://hdl.handle.net/2117/770072015-09-22T10:11:25ZCáceres, JoseHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelPuertas, M. LuzOn global location-domination in bipartite graphs
http://hdl.handle.net/2117/28318
On global location-domination in bipartite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
Tue, 16 Jun 2015 09:42:50 GMThttp://hdl.handle.net/2117/283182015-06-16T09:42:50ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelOn perfect and quasiperfect domination in graphs
http://hdl.handle.net/2117/27709
On perfect and quasiperfect domination in graphs
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M Luz
Mon, 04 May 2015 10:26:03 GMThttp://hdl.handle.net/2117/277092015-05-04T10:26:03ZCáceres, JoséHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelPuertas, M LuzGlobal location-domination in graphs
http://hdl.handle.net/2117/27680
Global location-domination in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel
A 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 are called LD-codes and the cardinality of an LD-code is the
location-domination number (G). An LD-set
S of a graph G is global if it is an LD-set of both G and its complement G. The
global location-domination number g(G) is the minimum cardinality of a global LD-set of
G. In this work,we give some relations between locating-dominating sets and the location-domination number in a graph and its complement
Domination, Global domination, Locating domination, Complement graph, Block-cactus, Trees
Thu, 30 Apr 2015 08:12:31 GMThttp://hdl.handle.net/2117/276802015-04-30T08:12:31ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelA 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 are called LD-codes and the cardinality of an LD-code is the
location-domination number (G). An LD-set
S of a graph G is global if it is an LD-set of both G and its complement G. The
global location-domination number g(G) is the minimum cardinality of a global LD-set of
G. In this work,we give some relations between locating-dominating sets and the location-domination number in a graph and its complementStrong product of graphs: Geodetic and hull number and boundary-type sets
http://hdl.handle.net/2117/8413
Strong product of graphs: Geodetic and hull number and boundary-type sets
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz
Tue, 27 Jul 2010 09:58:31 GMThttp://hdl.handle.net/2117/84132010-07-27T09:58:31ZCáceres, JoséHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelPuertas González, María Luz