On global location-domination in graphs

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 are called $LD$-codes and the cardinality of an LD-code is the location-domination number $\lambda(G)$. An LD-set $S$ of a graph $G$ is global if it is an LD-set of both $G$ and its complement $\overline{G}$. The global location-domination number $\lambda_g(G)$ is the minimum cardinality of a global LD-set of $G$. In this work, we give some relations between locating-dominating sets and the location-domination number in a graph and its complement.Comment: 15 pages: 2 tables; 8 figures; 20 reference

On global location-domination in graphs

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 are called LD-codes and the cardinality of an LD-code is the location-domination number lambda(G). An LD-set S of a graph G is global if it is an LD-set of both G and its complement G'. The global location-domination number lambda g(G) is introduced as the minimum cardinality of a global LD-set of G. In this paper, some general relations between LD-codes and the location-domination number in a graph and its complement are presented first. Next, a number of basic properties involving the global location-domination number are showed. Finally, both parameters are studied in-depth for the family of block-cactus graphs.Postprint (published version

LD-graphs and global location-domination in bipartite graphs

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 are called LD - codes and the cardinality of an LD-code is the location-domination number , ¿ ( G ). An LD-set S of a graph G is global if it is an LD-set for both G and its complement, G . One of the main contributions of this work is the definition of the LD-graph ,an edge-labeled graph associated to an LD-set, that will be very helpful to deduce some properties of location-domination in graphs. Concretely, we use LD-graphs to study the relation between the location-domination number in a bipartite graph and its complementPostprint (published version

Locating domination in bipartite graphs and their complements

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 number of G , ¿ ( G ), is the minimum cardinality of a locating-dominating set. In this work we study relationships between ¿ ( G ) and ¿ ( G ) for bipartite graphs. The main result is the characterization of all connected bipartite graphs G satisfying ¿ ( G ) = ¿ ( G ) + 1. To this aim, we define an edge-labeled graph G S associated with a distinguishing set S that turns out to be very helpfulPostprint (author's final draft

On global location-domination in bipartite graphs

Preprin

Global location-domination in graphs

Domination, Global domination, Locating domination, Complement graph, Block-cactus, TreesA 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 are called LD-codes and the cardinality of an LD-code is the location-domination number (G). An LD-set S of a graph G is global if it is an LD-set of both G and its complement G. The global location-domination number g(G) is the minimum cardinality of a global LD-set of G. In this work,we give some relations between locating-dominating sets and the location-domination number in a graph and its complementPreprin

Estudi bibliomètric any 2015. ESAB

El present document recull les publicacions indexades a la base de dades Scopus durant el període comprès entre el mesos de gener i desembre de l’any 2015, escrits per autors pertanyents a l’ESAB. Es presenten les dades recollides segons la font on s’ha publicat, els autors que han publicat, i el tipus de document publicat. S’hi inclou un annex amb la llista de totes les referències bibliogràfiques publicades.Postprint (published version

Articles publicats per investigadors de l'ETSEIB. Producció científica a Futur 2015

Postprint (author's final draft

Articles publicats per investigadors de l'ETSEIB. Producció científica a Futur 2015

Postprint (author's final draft