Recent Submissions

  • 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)
    External research report
    Open Access
    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)
    External research report
    Open Access
    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)
    External research report
    Open Access
  • On global location-domination in bipartite graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2015-06-10)
    External research report
    Open Access
  • Approximate results for rainbow labelings 

    Lladó Sánchez, Ana M. (2015-04-14)
    External research report
    Open Access
  • On star-forest ascending subgraph decomposition 

    Aroca Farrerons, José María; Lladó Sánchez, Ana M. (2015-04-14)
    External research report
    Open Access
  • Decomposing almost complete graphs by random trees 

    Lladó Sánchez, Ana M. (2015-04-14)
    External research report
    Open Access
  • 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 (2014-11-28)
    External research report
    Open Access
  • Global location-domination in graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2013-12-03)
    External research report
    Open Access
    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 ...
  • Jacobi matrices and boundary value problems in distance-regular graphs 

    Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia (2012-01-25)
    External research report
    Open Access
    In this work we analyze regular boundary value problems on a distance-regular graph associated with SchrÄodinger operators. These problems include the cases in which the boundary has two or one vertices. Moreover, we obtain ...

View more