Now showing items 1-20 of 53

  • 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)
    Conference lecture
    Open Access
  • 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)
    Part of book or chapter of book
    Restricted access - publisher's policy
    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 ...
  • 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)
    External research report
    Open Access
    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
    Open Access
    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
    Open Access
    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
    Open Access
  • Forma reduïda de Jordan : aplicacions 

    Magret Planas, Maria dels Dolors; Puig Pla, Carles; Hernando Martín, María del Carmen (Edicions UPC, 1997)
    Book
    Restricted access to the UPC academic community
    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)
    External research report
    Open Access
    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
    Open Access
    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
    Open Access
    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)
    External research report
    Open Access
    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
    Open Access
    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-09-02)
    Article
    Restricted access - publisher's policy
    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 ...
  • LD-graphs and global location-domination in bipartite graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014)
    Conference report
    Open Access
    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 ...
  • 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)
    Part of book or chapter of book
    Restricted access - publisher's policy
    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-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
    Restricted access - publisher's policy
    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 ...
  • Locating-dominating partitions in graphs 

    Pelayo Melero, Ignacio Manuel; Hernando Martín, María del Carmen; Mora Giné, Mercè (2016)
    Conference report
    Open Access
    Let G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ...
  • 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
    Restricted access - publisher's policy
  • 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)
    External research report
    Open Access
    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)
    Part of book or chapter of book
    Restricted access - publisher's policy
    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 ...