<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-ZHYMN2UK/44c1ab87-3e36-47d1-95a3-34e68be7d468/PDF"><dcterms:extent>367 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-ZHYMN2UK/0db03195-0254-4d67-ada1-0d9dc525cc66/TEXT"><dcterms:extent>34 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-ZHYMN2UK"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2015</dcterms:issued><dc:creator>Hernando, Carmen</dc:creator><dc:creator>Mora, Merce</dc:creator><dc:creator>Pelayo, Ignacio M.</dc:creator><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">letnik:8</dc:format><dc:format xml:lang="sl">str. 365-379</dc:format><dc:identifier>COBISSID:17377625</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-ZHYMN2UK</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">block-cactus</dc:subject><dc:subject xml:lang="sl">bločni kaktusni graf</dc:subject><dc:subject xml:lang="en">complement graph</dc:subject><dc:subject xml:lang="sl">dominacija</dc:subject><dc:subject xml:lang="en">domination</dc:subject><dc:subject xml:lang="en">global domination</dc:subject><dc:subject xml:lang="sl">globalna dominacija</dc:subject><dc:subject xml:lang="sl">komplementarni graf</dc:subject><dc:subject xml:lang="en">locating domination</dc:subject><dc:subject xml:lang="sl">lokacijska dominacija</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">On global location-domination in graphs|</dc:title><dc:description xml:lang="sl">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 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</dc:description><dc:description xml:lang="sl">Dominantna množica ?$S$? grafa ?$G$? se imenuje lokacijsko dominantna, na kratko LD-množica, če je vsako vozlišče ?$v$?, ki ni v ?$S$?, enolično določeno z množico sosedov vozlišča ?$v$?, ki pripadajo množici ?$S$?. Lokacijsko dominantne množice minimalne moči se imenujejo LD-kode, moč LD-kode pa je lokacijsko dominantno število ?$\lambda(G)$?. LD-množica ?$S$? grafa ?$G$? je globalna, če je LD-množica tako grafa ?$G$? kot tudi njegovega komplementa ?$\overline{G}$?. Globalno lokacijsko dominantno število ?$\lambda_g(G)$? je definirano kot minimalna moč globalne LD-množice grafa ?$G$?. V tem članku najprej predstavimo nekaj splošnih relacij med LD-kodami in lokacijsko dominantnim številom v grafu in njegovem komplementu. Nadalje izpeljemo nekaj osnovnih lastnosti globalnega lokacijskega dominantnega števila. Nazadnje podrobneje raziščemo oba parametra za družino bločnih kaktusnih grafov</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:DOC-ZHYMN2UK"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-ZHYMN2UK" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-ZHYMN2UK/44c1ab87-3e36-47d1-95a3-34e68be7d468/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:DOC-ZHYMN2UK/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-ZHYMN2UK" /></ore:Aggregation></rdf:RDF>