On global location-domination in graphs
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/28254
Tipus de documentArticle
Data publicació2015-05-29
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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.
CitacióHernando, M.; Mora, M.; Pelayo, I. M. On global location-domination in graphs. "ARS Mathematica Contemporanea", 29 Maig 2015, vol. 8, núm. 2, p. 365-379.
ISSN1855-3966
Versió de l'editorhttp://amc-journal.eu/index.php/amc/article/view/591/799
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
591-3878-1-PB.pdf | 319,9Kb | Visualitza/Obre |