Envíos recientes

  • From subKautz digraphs to cyclic Kautz digraphs 

    Dalfó Simó, Cristina (2017)
    Report de recerca
    Acceso abierto
    Kautz digraphs K(d,l) are a well-known 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 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Miller, Mirka; Ryan, Joe (2016)
    Report de recerca
    Acceso abierto
    In 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 

    Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
    Report de recerca
    Acceso abierto
    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
    Acceso abierto
    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
    Acceso abierto
    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
    Acceso abierto
    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
    Acceso abierto
    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
    Acceso abierto
  • 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
    Acceso abierto
  • Approximate results for rainbow labelings 

    Lladó Sánchez, Ana M. (2015-04-14)
    Report de recerca
    Acceso abierto

Muestra más