Exploració per autor "Pelayo Melero, Ignacio Manuel"Més informacióMés informació

Ara es mostren els items 56-67 de 67

    • Quasiperfect domination in trees 

      Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2015-12-18)
      Article
      Accés obert
      A k–quasiperfect dominating set ( k=1k=1) of a graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k–quasiperfect dominating ...

    • Resolving dominating partitions in graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2019-01-01)
      Article
      Accés obert
      A partition ¿ ={S1,...,Sk}of the vertex set of a connected graphGis called aresolvingpartitionofGif for every pair of verticesuandv,d(u,Sj)6=d(v,Sj), for some partSj. Thepartition dimensionßp(G) is the minimum cardinality ...

    • Some contributions from graph theory to the design and study of large and fault-tolerant interconnection networks 

      Pelayo Melero, Ignacio Manuel (Universitat Politècnica de Catalunya, 2000-03-13)
      Tesi
      Accés obert
      Esta tesis trata diversas cuestiones relacionadas con el diseño y estudio de redes de interconexión densas y fiables. Concretamente en ella se han incluido cuatro grupos de contribuciones. En primer lugar se presenta una ...

    • Some product graphs with power dominating number at most 2 

      Shahbaznejad, Najibeh; Kazemi, Adel P.; Pelayo Melero, Ignacio Manuel (Elsevier, 2021-07-08)
      Article
      Accés obert
      Let S be a set of vertices of a graph G. Let M[S] be the set of vertices built from the closed neighborhood N[S] of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its ...

    • 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 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 Longest path transit function of a graph and betweenness 

      Changat, Manoj; Prasanth, G. N.; Pelayo Melero, Ignacio Manuel (2010)
      Article
      Accés obert

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

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