<?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-3688P678/c22572be-9488-414f-a894-cca7d8a1130e/PDF"><dcterms:extent>489 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-3688P678/1a385a47-357d-418a-b50d-3914fa7d148a/TEXT"><dcterms:extent>48 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-3688P678"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2015</dcterms:issued><dc:creator>Malnič, Aleksander</dc:creator><dc:creator>Pisanski, Tomaž</dc:creator><dc:creator>Žitnik, Arjana</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:8</dc:format><dc:format xml:lang="sl">str. 95-113</dc:format><dc:identifier>COBISSID:17359705</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-3688P678</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">automorphisms</dc:subject><dc:subject xml:lang="sl">avtomorfizmi</dc:subject><dc:subject xml:lang="en">canonical cover</dc:subject><dc:subject xml:lang="en">covering projection</dc:subject><dc:subject xml:lang="sl">kanonični krov</dc:subject><dc:subject xml:lang="sl">krovna projekcija</dc:subject><dc:subject xml:lang="en">regular cover</dc:subject><dc:subject xml:lang="sl">regularni krov</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">The clone cover|</dc:title><dc:description xml:lang="sl">Each finite graph on ?$n$? vertices determines a special ?$(n-1)$?-fold covering graph that we call the clone cover. Several equivalent definitions and basic properties about this remarkable construction are presented. In particular, we show that for ?$k \geq 2$?, the clone cover of a ?$k$?-connected graph is ?$k$?-connected, the clone cover of a planar graph is planar and the clone cover of a hamiltonian graph is hamiltonian. As for symmetry properties, in most cases we also understand the structure of the automorphism groups of these covers. A particularly nice property is that every automorphism of the base graph lifts to an automorphism of its clone cover. We also show that the covering projection from the clone cover onto its corresponding ?$2$?-connected base graph is never a regular covering, except when the base graph is a cycle</dc:description><dc:description xml:lang="sl">Vsak končen graf na ?$n$? vozliščih določa posebni ?$(n-1)$?-listni krovni graf, ki ga imenujemo klonski krov. Predstavimo več ekvivalentnih definicij in osnovnih lastnosti v zvezi s to zanimivo konstrukcijo. Tako npr. pokažemo, da je za ?$k$? vsaj 2 klonski krov ?$k$?-povezanega grafa ?$k$?-povezan, da je klonski krov ravninskega grafa ravninski in da je klonski krov hamiltonskega grafa hamiltonski. Kar se tiče simetrijskih lastnosti, v večini primerov razumemo tudi strukturo grupe avtomorfizmov teh krovov. Posebej lepa lastnost je na primer, da se vsak avtomorfizem baznega grafa dvigne do avtomorfizma njegovega klonskega krova. Pokažemo tudi, da krovna projekcija klonskega krova na ustrezni ?$2$?-povezani bazni graf nikoli ni regularen krov, razen kadar je osnovni graf cikel</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-3688P678"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-3688P678" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-3688P678/c22572be-9488-414f-a894-cca7d8a1130e/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-3688P678/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-3688P678" /></ore:Aggregation></rdf:RDF>