Exploració per tema "Dominació (Grafs, Teoria de)"

Ara es mostren els items 1-2 de 2

    • On global location-domination in graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2015-05-29)
      Article
      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 of minimum cardinality ...

    • On k-domination and j-independence in graphs 

      Hansberg Pastor, Adriana; Pepper, Ryan (2013-07)
      Article
      Accés restringit per política de l'editorial
      Let GG be a graph and let kk and jj be positive integers. A subset DD of the vertex set of GG is a kk-dominating set if every vertex not in DD has at least kk neighbors in DD. The kk-domination numberγk(G)γk(G) is the ...