<?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-1RSCHKSS/0ef549f7-2bdb-4030-a34f-71ca2c5f2144/PDF"><dcterms:extent>340 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-1RSCHKSS/9dd2c653-0f52-4111-af21-892c6338434b/TEXT"><dcterms:extent>35 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-1RSCHKSS"><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>Potočnik, Primož</dc:creator><dc:creator>Seifter, Norbert</dc:creator><dc:creator>Šparl, Primož</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. 83-94</dc:format><dc:identifier>COBISSID:17187161</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-1RSCHKSS</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">Cayley digraph</dc:subject><dc:subject xml:lang="sl">Cayleyjev digraf</dc:subject><dc:subject xml:lang="sl">dosegljivostna relacija</dc:subject><dc:subject xml:lang="en">reachability relation</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Reachability relations, transitive digraphs and groups|</dc:title><dc:description xml:lang="sl">In A. Malnič, D. Marušič, N. Seifter, P. Šparl and B. Zgrablič, Reachability relations in digraphs, Europ. J. Combin. 29 (2008), 1566-1581 it was shown that properties of digraphs such as growth, property ?$\mathbf{Z}$?, and number of ends are reflected by the properties of certain reachability relations defined on the vertices of the corresponding digraphs. In this paper we study these relations in connection with certain properties of automorphism groups of transitive digraphs. In particular, one of the main results shows that if atransitive digraph admits a nilpotent subgroup of automorphisms with finitely many orbits, then its nilpotency class and the number of orbits are closely related to particular properties of reachability relations defined on the digraphs in question. The obtained results have interesting implications for Cayley digraphs of certain types of groups such as torsion-free groups of polynomial growth</dc:description><dc:description xml:lang="sl">V A. Malnič, D. Marušič, N. Seifter, P. Šparl and B. Zgrablič, Reachability relations in digraphs, Europ. J. Combin. 29 (2008), 1566-1581 je bilo pokazano, da se lastnosti usmerjenih grafov, kot so rast, lastnost ?$\mathbf{Z}$?, in število koncev odražajo v lastnostih določenih dosegljivostnih relacij definiranih na vozliščih ustreznih digrafov. V tem članku obravnavamo te relacije v povezavi z določenimi lastnostmi grup avtomorfizmov tranzitivnih digrafov. Posebej, eden od glavnih rezultatov kaže, da če tranzitivni digraf dopušča nilpotentno podgrupo avtomorfizmov s končno mnogo orbitami, potem sta njegov nilpotentni razred in število obit tesno povezana z določenimi lastnostmi dosegljivostnih relacij, definiranih na ustreznih digrafih. Dobljeni rezultati imajo zanimive implikacije za Cayleyeve digrafe določenih tipov grup, kot so grupe brez torzije s polinomsko rastjo</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-1RSCHKSS"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-1RSCHKSS" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-1RSCHKSS/0ef549f7-2bdb-4030-a34f-71ca2c5f2144/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-1RSCHKSS/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-1RSCHKSS" /></ore:Aggregation></rdf:RDF>