{"?xml":{"@version":"1.0"},"edm: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-LN5JUSNT/1f5bf99c-c161-4ee6-b1c1-b49378e7dc1d/PDF","dcterms:extent":"416 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-LN5JUSNT/7f7b3fb8-263a-4573-b81e-1252bcffb952/TEXT","dcterms:extent":"40 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-LN5JUSNT","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2018","dc:creator":"Mednykh, Ilya","dc:format":[{"@xml:lang":"sl","#text":"letnik:15"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"str. 467-485"}],"dc:identifier":["ISSN:1855-3966","COBISSID:18596697","URN:URN:NBN:SI:doc-LN5JUSNT"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"sl","#text":"I-graf"},{"@xml:lang":"sl","#text":"Jacobijeva grupa"},{"@xml:lang":"sl","#text":"Petersenov graf"},{"@xml:lang":"sl","#text":"polinom Čebiševa"},{"@xml:lang":"sl","#text":"vpeto drevo"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials|"},"dc:description":{"@xml:lang":"sl","#text":"Obravnavamo družino ?$I$?-grafov ?$I(n, k, l)$?, ki predstavlja posplošitev razreda posplošenih Petersenovih grafov. V tem članku podamo novo metodo štetja v Jacobijevi grupi ?$I$?-grafa ?$I(n, k, l)$?. Pokažemo, da je minimalno število generatorjev grupe Jac?$(I(n, k, l))$? najmanj dve in največ ?$2k + 2l - 1$?. Podamo tudi zaključeno formulo za število vpetih dreves grafa ?$I(n, k, l)$?, izraženo s polinomi Čebiševa. Raziskujemo nekaj aritmetičnih lastnosti tega števila in njegovo asimptotično vedenje"},"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-LN5JUSNT","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-LN5JUSNT"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-LN5JUSNT/1f5bf99c-c161-4ee6-b1c1-b49378e7dc1d/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-LN5JUSNT/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-LN5JUSNT"}}}}