Ara es mostren els items 1-20 de 62

    • 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
    • Coloración de grafos por vecindades diferentes. 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Alcom, Liliana; Gutierrez, Marisa (2017-07-07)
      Capítol de llibre
      Accés restringit per política de l'editorial
      En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
    • Dimensión métrica y dimensión métrica tolerante en grafos MOP. 

      Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2023)
      Text en actes de congrés
      Accés obert
      En este trabajo estudiamos la dimensión métrica y la dimensión métrica tolerante en grafos periplanos maximales. Concretamente, damos cotas ajustadas de ambos parámetros y caracterizamos los grafos que alcanzan las cotas ...
    • Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-10-16)
      Report de recerca
      Accés obert
      Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ...
    • Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs 

      Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2018-04-20)
      Article
      Accés obert
      Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ...
    • Extremal graph theory for metric dimension and diameter 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Seara Ojea, Carlos; Wood, David (2010-02-22)
      Article
      Accés obert
      A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. Let ...
    • Extremal graph theory for metric dimension and diameter 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos; Wood, David (2010)
      Article
      Accés obert
    • Forma reduïda de Jordan : aplicacions 

      Magret Planas, Maria dels Dolors; Puig Pla, Carles; Hernando Martín, María del Carmen (Edicions UPC, 1997)
      Llibre
      Accés restringit a la comunitat UPC
      La forma reduïda de Jordan té un paper fonamental en la classificació d'endoformismes i és extramadament important en la Matemàtica Aplicada, ja que dóna resposta a qüestions relatives a una gran diversitat d'aplicacions. ...
    • General bounds on limited broadcast domination 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
      Report de recerca
      Accés obert
      Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ...
    • General bounds on limited broadcast domination 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (Chapman & Hall/CRC, 2018-10-26)
      Article
      Accés obert
      Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and ...
    • Geometric tree graphs of points in convex position 

      Hernando Martín, María del Carmen; Hurtado Díaz, Fernando Alfredo; Márquez Pérez, Alberto; Mora Giné, Mercè; Noy Serrano, Marcos (1997)
      Article
      Accés obert
      Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and $T_2$ are adjacent ...
    • Global location-domination in graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2013-12-03)
      Report de recerca
      Accés obert
      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 ...
    • Graphs of non-crossing perfect matchings 

      Hernando Martín, María del Carmen; Hurtado Díaz, Fernando Alfredo; Noy Serrano, Marcos (2001)
      Article
      Accés obert
      Let Pn be a set of n = 2m points that are the vertices of a convex polygon, and let Mm be the graph having as vertices all the perfect matchings in the point set Pn whose edges are straight line segments and do not cross, ...
    • LD-graphs and global location-domination in bipartite graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014)
      Text en actes de congrés
      Accés obert
      A dominating setS of a graph G is a locating-dominating-set, LD-set for 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 ...
    • LD-graphs and global location-domination in bipartite graphs 

      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
      A dominating set S of a graph G is a locating-dominating-set, LD-set for 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 ...
    • Limited broadcast domination: upper bounds and complexity 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-07-07)
      Capítol de llibre
      Accés restringit per política de l'editorial
      En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
    • Locating domination in bipartite graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2018-01-01)
      Article
      Accés obert
      A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ...
    • Locating domination in bipartite graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
      Report de recerca
      Accés obert
      A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ...
    • Locating domination in bipartites graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-07-07)
      Capítol de llibre
      Accés restringit per política de l'editorial
      En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
    • Locating domination in graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (Universidad de Sevilla, 2013-10-16)
      Capítol de llibre
      Accés obert
      A dominating set S of a graph G is called locating-dominating , LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets ...