<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-13T13:13:23Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/28254" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/28254</identifier><datestamp>2025-07-17T06:51:53Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>On global location-domination in graphs</dc:title>
   <dc:creator>Hernando Martín, María del Carmen</dc:creator>
   <dc:creator>Mora Giné, Mercè</dc:creator>
   <dc:creator>Pelayo Melero, Ignacio Manuel</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions</dc:contributor>
   <dc:subject>Àrees temàtiques de la UPC::Matemàtiques i estadística</dc:subject>
   <dc:subject>Domination (Graph theory)</dc:subject>
   <dc:subject>Domination</dc:subject>
   <dc:subject>global domination</dc:subject>
   <dc:subject>locating domination</dc:subject>
   <dc:subject>complement graph</dc:subject>
   <dc:subject>block-cactus.</dc:subject>
   <dc:subject>Dominació (Grafs, Teoria de)</dc:subject>
   <dc:description>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.&#xd;
&#xd;
In this paper, some general relations between  LD-codes and the location-domination number in a graph and its complement are presented first.&#xd;
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.</dc:description>
   <dc:description>Postprint (published version)</dc:description>
   <dc:date>2015-05-29</dc:date>
   <dc:type>Article</dc:type>
   <dc:identifier>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.</dc:identifier>
   <dc:identifier>1855-3966</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/28254</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>http://amc-journal.eu/index.php/amc/article/view/591/799</dc:relation>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivs 3.0 Spain</dc:rights>
   <dc:format>15 p.</dc:format>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>