Exploració per tema "Cartesian product"

Ara es mostren els items 1-4 de 4

    • Neighbor-locating coloring: graph operations and extremal cardinalities 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2018-07-01)
      Article
      Accés obert
      A k–coloring of a graph is a k-partition of V into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices u, v belonging to the same color , the set of colors of the ...

    • On congruence in $Z^n$ and the dimension of a multidimensional circulant 

      Fiol Mora, Miquel Àngel (Elsevier, 1995)
      Article
      Accés obert
      From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn to be Cayley (di)graphs of Abelian groups. This paper is mainly ...

    • On the metric dimension of infinite graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2009-11-04)
      Article
      Accés restringit per política de l'editorial
      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 a graph G is the minimum cardinality of a resolving set. In ...

    • The generalized hierarchical product of graphs 

      Barrière Figueroa, Eulalia; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Mitjana Riera, Margarida (2008-01)
      Article
      Accés obert
      A generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs ...