Enviaments recents

  • Connected and internal graph searching 

    Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
    Report de recerca
    Accés obert
    This 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 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
    Report de recerca
    Accés obert
    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 ...
  • Symmetry breaking in tournaments 

    Lozano Bojados, Antoni (2010)
    Report de recerca
    Accés obert
    We 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 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2016-03-05)
    Report de recerca
    Accés obert
    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 ...
  • On cyclic Kautz digraphs 

    Böhmová, Katerina; Dalfó Simó, Cristina; Huemer, Clemens (2015)
    Report de recerca
    Accés obert
    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 ...
  • 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 (2015-05-29)
    Report de recerca
    Accés obert
  • On global location-domination in bipartite graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2015-06-10)
    Report de recerca
    Accés obert
  • Approximate results for rainbow labelings 

    Lladó Sánchez, Ana M. (2015-04-14)
    Report de recerca
    Accés obert
  • On star-forest ascending subgraph decomposition 

    Aroca Farrerons, José María; Lladó Sánchez, Ana M. (2015-04-14)
    Report de recerca
    Accés obert
  • Decomposing almost complete graphs by random trees 

    Lladó Sánchez, Ana M. (2015-04-14)
    Report de recerca
    Accés obert

Mostra'n més