Ara es mostren els items 4-10 de 10

    • Independent [1,2]-number versus independent domination number 

      Aleid, Sahar A.; Mora Giné, Mercè; Puertas González, María Luz (2017-01-01)
      Article
      Accés obert
      A [1, 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of ...
    • On geodetic sets formed by boundary vertices 

      Cáceres González, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz; Seara Ojea, Carlos (2003)
      Article
      Accés obert
      Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types ...
    • 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 ...
    • On the metric representation of the vertices of a graph 

      Mora Giné, Mercè; Puertas González, María Luz (2023-09-12)
      Article
      Accés restringit per política de l'editorial
      The metric representation of a vertex u in a connected graph G respect to an ordered vertex subset is the vector of distances . A vertex subset W is a resolving set of G if , for every with . Thus, a resolving set with n ...
    • 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)
      Report de recerca
      Accés obert