<?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-GME1S33Q/6f75b46d-3663-4dad-bee2-992ab8fa329b/PDF"><dcterms:extent>449 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-GME1S33Q/cb0e0981-2860-4fa7-b867-2bf4023f88e0/TEXT"><dcterms:extent>45 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-GME1S33Q/9d35de98-1b25-46fe-b401-660bd7b3269a/PDF"><dcterms:extent>176 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-GME1S33Q/08c88274-8695-453e-bd70-3ad6a1054e55/TEXT"><dcterms:extent>4 KB</dcterms:extent></edm:WebResource><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-GME1S33Q"><dcterms:issued>2020</dcterms:issued><dc:creator>Jajcay, Robert</dc:creator><dc:creator>Jasenčáková, Katarína</dc:creator><dc:creator>Pisanski, Tomaž</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:3</dc:format><dc:format xml:lang="sl">art. P1.04 (20 str.)</dc:format><dc:identifier>DOI:10.26493/2590-9770.1279.02c</dc:identifier><dc:identifier>ISSN:2590-9770</dc:identifier><dc:identifier>COBISSID_HOST:26583043</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-GME1S33Q</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dc:source xml:lang="sl">The art of discrete and applied mathematics</dc:source><dc:subject xml:lang="en">arc-transitive graph</dc:subject><dc:subject xml:lang="en">automorphism group</dc:subject><dc:subject xml:lang="en">Cayley graph</dc:subject><dc:subject xml:lang="sl">Cayleyjev graf</dc:subject><dc:subject xml:lang="en">generalised Petersen graph</dc:subject><dc:subject xml:lang="sl">grupa avtomorfizmov</dc:subject><dc:subject xml:lang="sl">ločno-tranzitiven graf</dc:subject><dc:subject xml:lang="sl">posplošeni Petersenov graf</dc:subject><dc:subject xml:lang="sl">točkovno-tranzitiven graf</dc:subject><dc:subject xml:lang="en">vertex-transitive graph</dc:subject><dc:title xml:lang="sl">A new generalization of generalized Petersen graphs|</dc:title><dc:description xml:lang="sl">We discuss a new family of cubic graphs, which we call ?$SGP$?-graphs, that bears a close resemblance to the family of generalized Petersen graphs; both in definition and properties. The focus of our paper is on determining the algebraic properties of graphs from our new family. We look for highly symmetric graphs, e.g., graphs with large automorphism groups, vertex- or arc-transitive graphs. In particular, we present arithmetic conditions for the defining parameters that guarantee that graphs with these parameters are vertex-transitive or Cayley, and we find one arc-transitive ?$SGP$?-graph which is neither a ?$CQ$? graph of Feng and Wang, nor a generalized Petersen graph</dc:description><dc:description xml:lang="sl">Obravnavamo novo družino kubičnih grafov, ki jo imenujemo grupno deljivi posplošeni Petersenovi grafi (?$SGP$?-grafi), in je, tako po definiciji kot po lastnostih, zelo podobna družini posplošenih Petersenovih grafov. V članku se osredotočamo na določitev algebraičnih lastnosti grafov naše nove družine. Iščemo visoko simetrične grafe, t.j. grafe z velikimi grupami avtomorfizmov, in točkovno- ali ločno-tranzitivne grafe. Posebej, podamo aritmetične pogoje za določitvene parametre, ki zagotavljajo, da so grafi s temi parametritočkovno-tranzitivni ali Cayleyjevi, in poiščemo primer ločno-tranzitivnega ?$SGP$?-grafa,ki ni niti ?$CQ$? graf Fenga in Wanga niti posplošeni Petersenov graf</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-GME1S33Q"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-GME1S33Q" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-GME1S33Q/6f75b46d-3663-4dad-bee2-992ab8fa329b/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-GME1S33Q/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-GME1S33Q" /></ore:Aggregation></rdf:RDF>