{"?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-VB1IZ287/776EC698-2EDE-4679-BCB6-8B79274802D1/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-VB1IZ287/28688f09-29fe-4e31-9766-d599c5ffe413/PDF","dcterms:extent":"278 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-VB1IZ287/cb3d6b20-d073-4d50-9f09-c36426862628/TEXT","dcterms:extent":"45 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-VB1IZ287","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2009","dc:creator":["Petkovšek, Marko","Zakrajšek, Helena"],"dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:2"},{"@xml:lang":"sl","#text":"str. 241-262"}],"dc:identifier":["COBISSID:15497049","ISSN:1855-3966","URN:URN:NBN:SI:doc-VB1IZ287"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"sl","#text":"kombinatorika"},{"@xml:lang":"sl","#text":"matematika"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Enumeration of I-graphs: Burnside does it again|"},"dc:description":{"@xml:lang":"sl","#text":"We give explicit and efficiently computable formulas for the number of isomorphism classes of I-graphs, connected I-graphs, bipartite connected I-graphs, generalized Petersen graphs, and bipartite generalized Petersen graphs. The tool that we use is the well-known Cauchy-Frobenius-Burnside lemma"},"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-VB1IZ287","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-VB1IZ287"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-VB1IZ287/776EC698-2EDE-4679-BCB6-8B79274802D1/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-VB1IZ287/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-VB1IZ287"}}}}