<?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-SQNRNC7F/aaad96d8-3b30-4707-8f01-5ef939914429/PDF"><dcterms:extent>617 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-SQNRNC7F/c913bd11-d12c-4171-9458-18d6c921daa7/TEXT"><dcterms:extent>9 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-SQNRNC7F/00d7b570-0c3c-421b-88fa-b8123c46e1ae/PDF"><dcterms:extent>203 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-SQNRNC7F/ba5dd283-36c6-4527-bd38-4f23831d2a79/TEXT"><dcterms:extent>4 KB</dcterms:extent></edm:WebResource><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-SQNRNC7F"><dcterms:issued>2026</dcterms:issued><dc:creator>Bašić, Nino</dc:creator><dc:creator>Gévay, Gábor</dc:creator><dc:creator>Pisanski, Tomaž</dc:creator><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">letnik:9</dc:format><dc:format xml:lang="sl">str. 1-6</dc:format><dc:identifier>DOI:10.26493/2590-9770.1914.42a</dc:identifier><dc:identifier>COBISSID_HOST:258543107</dc:identifier><dc:identifier>ISSN:2590-9770</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-SQNRNC7F</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">generalized Petersen graph</dc:subject><dc:subject xml:lang="en">Möbius–Kantor graph</dc:subject><dc:subject xml:lang="sl">Möbius–Kantorjev graf</dc:subject><dc:subject xml:lang="sl">policirkulant</dc:subject><dc:subject xml:lang="en">polycirculant</dc:subject><dc:subject xml:lang="sl">posplošeni Petersenov graf</dc:subject><dc:subject xml:lang="en">unit-distance graph</dc:subject><dc:subject xml:lang="sl">zvest graf z enotsko razdaljo</dc:subject><dc:title xml:lang="sl">The Möbius-Kantor graph is a faithful unit-distance graph|</dc:title><dc:description xml:lang="sl">In this paper, it has been shown that the generalized Petersen graph GP(8, 3), also known as the Möbius-Kantor graph, admits a faithful unit-distance representation in the plane</dc:description><dc:description xml:lang="sl">V temˇclanku je bilo dokazano, da posplošeni Petersenov grafGP(8,3), znan tudi kotMöbius–Kantorjev graf, dopušˇca zvesto enotsko-razdaljno upodobitev v ravnini</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-SQNRNC7F"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-SQNRNC7F" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-SQNRNC7F/aaad96d8-3b30-4707-8f01-5ef939914429/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-SQNRNC7F/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-SQNRNC7F" /></ore:Aggregation></rdf:RDF>