<?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-K5V48XH8/91c87a26-8a40-4253-ae4c-391992b99137/PDF"><dcterms:extent>252 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-K5V48XH8/1217fe04-5a68-4a7e-9d5a-67d43199120b/TEXT"><dcterms:extent>27 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-K5V48XH8"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2020</dcterms:issued><dc:creator>Klobučar, Ana</dc:creator><dc:creator>Klobučar, Antoaneta</dc:creator><dc:format xml:lang="sl">letnik:19</dc:format><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">str. 337-349</dc:format><dc:identifier>ISSN:1855-3974</dc:identifier><dc:identifier>COBISSID_HOST:44983555</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-K5V48XH8</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">cardinal products of graphs</dc:subject><dc:subject xml:lang="sl">cikli</dc:subject><dc:subject xml:lang="en">cycles</dc:subject><dc:subject xml:lang="en">double Roman domination</dc:subject><dc:subject xml:lang="sl">dvojna rimljanska dominacija</dc:subject><dc:subject xml:lang="sl">kardinalni produkti grafov</dc:subject><dc:subject xml:lang="en">paths</dc:subject><dc:subject xml:lang="sl">poti</dc:subject><dc:subject xml:lang="sl">rimljanska dominacija</dc:subject><dc:subject xml:lang="en">Roman domination</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Properties of double Roman domination on cardinal products of graphs|</dc:title><dc:description xml:lang="sl">Double Roman domination is a stronger version of Roman domination that doubles the protection. The areas now have 0, 1, 2 or 3 legions. Every attacked area needs 2 legions for its defence, either their own, or borrowed from 1 or 2 neighbouring areas, which still have to keep at least 1 legion to themselves. The minimal number of legions in all areas together is equal to the double Roman domination number. In this paper we determine an upper bound and a lower bound for double Roman domination numbers on cardinal product of any two graphs. Also we determine the exact values of double Roman domination numbers on ?$P_2 \times G$? (for many types of graph ?$G$?). Also, the double Roman domination number is found for ?$P_2 \times P_n$?, ?$P_3 \times P_n$?, ?$P_4 \times P_n$?, while upper and lower bounds are given for ?$P_5 \times P_n$? and ?$P_6 \times P_n$?. Finally, we will give a case study to determine the efficiency of double protection. We will compare double Roman domination versus Roman domination by running a simulation of a battle</dc:description><dc:description xml:lang="sl">Dvojna rimljanska dominacija je krepkejša verzija rimljanske dominacije, ki podvaja zaščito. Območja imajo zdaj 0, 1, 2 ali 3 legije. Vsako napadeno območje potrebuje 2 legiji za svojo obrambo, in to bodisi lastni bodisi izposojeni od 1 ali 2 sosednih območij, ki pa morata še vedno ohraniti najmanj 1 legijo zase. Minimalno število legij na vseh območjih skupaj je enako dvojnemu rimljanskemu dominacijskemu številu. V tem članku določimo zgornjo mejo in spodnjo mejo za dvojno rimljansko dominacijska števila kardinalnih produktov poljubnih dveh grafov. Prav tako določimo natančne vrednosti dvojno rimljanskih dominacijskih števil grafov ?$P_2 \times G$? (za mnoge vrste grafa ?$G$?). Prav tako najdemo dvojno rimljansko dominacijsko število grafov ?$P_2 \times P_n$?, ?$P_3 \times P_n$?, ?$P_4 \times P_n$?, za grafa ?$P_5 \times P_n$? in ?$P_6 \times P_n$? pa predstavimo zgornji in spodnji meji. Nazadnje predstavimo študijo primera za določitev učinkovitosti dvojne zaščite. Primerjali bomo dvojno rimljansko dominacijo in rimljansko dominacijo na ta način, da bomo pognali simulacijo bitke</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-K5V48XH8"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-K5V48XH8" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-K5V48XH8/91c87a26-8a40-4253-ae4c-391992b99137/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-K5V48XH8/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-K5V48XH8" /></ore:Aggregation></rdf:RDF>