Now showing items 1-5 of 5

  • 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
  • On perfect and quasiperfect dominations in graphs 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2014)
    Conference report
    Open Access
  • On the metric dimension of infinite graphs 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz (2012-12-07)
    Article
    Restricted access - publisher's policy
    A set of vertices Sresolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In this paper ...
  • 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 (2009-12)
    External research report
    Open Access
  • The graph distance game and some graph operations 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2014)
    Conference report
    Open Access
    In the graph distance game, two players alternate in constructing a max- imal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to ...