• Boundary-type sets and product operators in graphs 

    Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2010)
    Comunicació de congrés
    Accés obert
  • Locating-dominating codes: Bounds and extremal cardinalities 

    Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2013-09-01)
    Article
    Accés restringit per política de l'editorial
    In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses ...
  • On locating and dominating sets in graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Cáceres, Jose; Puertas González, María Luz; Pelayo Melero, Ignacio Manuel (2009)
    Comunicació de congrés
    Accés obert
  • On the determining number and the metric dimension of graphs 

    Cáceres, Jose; Garijo, Delia; Puertas González, María Luz; Seara Ojea, Carlos (2010-04-19)
    Article
    Accés obert
    This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian ...
  • On the geodetic and the hull numbers in strong product graphs 

    Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2010-12)
    Article
    Accés restringit per política de l'editorial
    A set S of vertices of a connected graph G is convex, if for any pair of vertices u,vS, every shortest path joining u and v is contained in S. The convex hull CH(S) of a set of vertices S is defined as the smallest convex ...
  • 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
  • The graph distance game and some graph operations 

    Cáceres, Jose; Puertas, M. Luz; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014-09-02)
    Article
    Accés restringit per política de l'editorial
    In the graph distance game, two players alternate in constructing a maximal 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 ...