Exploració per autor "Hernando Martín, María del Carmen"Més informacióMés informació

Ara es mostren els items 53-62 de 62

    • Some structural, metric and convex properties of the boundary of a graph 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos (2013-04-25)
      Article
      Accés obert
      Let u;v be two vertices of a connected graph G . The vertex v is said to be a boundary vertex of u if no neighbor of v is further away from u than v . The boundary of a graph is the set of all its ...

    • 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

    • The neighbor-locating-chromatic number of trees and unicyclic graphs 

      Alcón, Liliana; Gutierrez, Marisa; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2023)
      Article
      Accés obert
      A k-coloring of a graph G is a partition of the vertices of G into k independent sets, which are called colors. A k-coloring is neighbor-locating if any two vertices belonging to the same color can be distinguished from ...

    • The equidistant dimension of graphs 

      González Herrera, Antonio; Hernando Martín, María del Carmen; Mora Giné, Mercè (2022-05-06)
      Article
      Accés obert
      A subset S of vertices of a connected graph G is a distance-equalizer set if for every two distinct vertices x,y¿V(G)\S there is a vertex w¿S such that the distances from x and y to w are the same. The equidistant dimension ...

    • 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 ...

    • 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)
      Text en actes de congrés
      Accés obert
      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 ...

    • The neighbor-locating-chromatic number of pseudotrees 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Gonzalez, Marisa; Alcón, Liliana (2019-03-28)
      Report de recerca
      Accés obert
      Ak-coloringof a graphGis a partition of the vertices ofGintokindependent sets,which are calledcolors. Ak-coloring isneighbor-locatingif any two vertices belongingto the same color can be distinguished from each other by ...

    • Total domination in plane triangulations 

      Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2020-11-09)
      Report de recerca
      Accés obert

    • Total domination in plane triangulations 

      Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2021-01-01)
      Article
      Accés obert
      A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ...

    • Watching systems in complete bipartite graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2012)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Many problems related to location and domination give raise to different parameters in graphs. The aim is to determine the location of some facility, object, item by placing watchers in some vertices of the graph. Watching ...