<?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-D1UBGKNA/f05a4167-428f-4fdd-bb00-0a2c6aff542d/PDF"><dcterms:extent>427 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-D1UBGKNA/940ce44b-1287-419a-a0f5-d410001b33e0/TEXT"><dcterms:extent>40 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-D1UBGKNA"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2017</dcterms:issued><dc:creator>Bevan, David</dc:creator><dc:creator>Erskine, Grahame</dc:creator><dc:creator>Lewis, Robert</dc:creator><dc:format xml:lang="sl">letnik:13</dc:format><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">str. 275-291</dc:format><dc:identifier>COBISSID:18355033</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-D1UBGKNA</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="sl">Cayleyjevi grafi</dc:subject><dc:subject xml:lang="sl">cirkulantni grafi</dc:subject><dc:subject xml:lang="sl">problem stopenj in premera</dc:subject><dc:subject xml:lang="sl">vsote množic</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Large circulant graphs of fixed diameter and arbitrary degree|</dc:title><dc:description xml:lang="sl">We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case. We present a direct product construction yielding improved bounds for small diameters and introduce a new general technique for "stitching" together circulant graphs which enables us to improve the current best known asymptotic orders for every diameter. As an application, we use our constructions in the directed case to obtain upper bounds on the minimum size of a subset ?$A$? of a cyclic group of order ?$n$? such that the ?$k$?-fold sumset ?$kA$? is equal to the whole group. We also present a revised table of largest known circulant graphs of small degree and diameter</dc:description><dc:description xml:lang="sl">Obravnavamo problem, ki se nanaša na stopnjo in premer neusmerjenih in usmerjenih cirkulantnih grafov. Doslej so se poskusi generirati družine velikih cirkulantnih grafov poljubne stopnje pri danem premeru osredotočali predvsem na primer, ko je premer 2. Predstavimo konstrukcijo z direktnim produktom, ki da izboljšane meje za majhne premere in vpeljemo novo splošno tehniko za "šivanje" cirkulantnih grafov, ki nam omogoča izboljšavo trenutno najboljših znanih asimptotskih redov za vsak premer. Kot primer aplikacije, z uporabo naše konstrukcije v usmerjenem primeru dobimo zgornje meje za minimalno velikost podmnožice ?$A$? ciklične grupe reda ?$n$?, takšne da je ?$k$?-listna vsota množic ?$kA$? enaka celotni grupi. Predstavimo tudi popravljeno tabelo največjih znanih cirkulantnih grafov majhne stopnje in premera</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-D1UBGKNA"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-D1UBGKNA" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-D1UBGKNA/f05a4167-428f-4fdd-bb00-0a2c6aff542d/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-D1UBGKNA/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-D1UBGKNA" /></ore:Aggregation></rdf:RDF>