{"?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-PHIQC6HV/d10a4d23-0e69-4871-8cc6-7f97bac019da/PDF","dcterms:extent":"345 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-PHIQC6HV/4e6d1919-f0b1-41ab-a051-a334da898065/TEXT","dcterms:extent":"33 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-PHIQC6HV/2608857f-9699-4974-b8d8-44117e745c61/PDF","dcterms:extent":"197 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-PHIQC6HV/2da066ce-9453-4ee1-8c16-efdf88ccf94f/TEXT","dcterms:extent":"3 KB"}],"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:DOC-PHIQC6HV","dcterms:issued":"2019","dc:creator":"Rus, Jernej","dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:2"},{"@xml:lang":"sl","#text":"P1.07 13 str."}],"dc:identifier":["DOI:10.26493/2590-9770.1251.b76","COBISSID_HOST:18698585","ISSN:2590-9770","URN:URN:NBN:SI:doc-PHIQC6HV"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:source":{"@xml:lang":"sl","#text":"The art of discrete and applied mathematics"},"dc:subject":[{"@xml:lang":"en","#text":"Eulerian graph"},{"@xml:lang":"sl","#text":"Eulerjev graf"},{"@xml:lang":"en","#text":"nanostructure design"},{"@xml:lang":"sl","#text":"oblikovanje nanostruktur"},{"@xml:lang":"sl","#text":"paralelni d-stabilni obhodi"},{"@xml:lang":"en","#text":"parallel d-stable trace"},{"@xml:lang":"sl","#text":"polipeptidi"},{"@xml:lang":"en","#text":"polypeptide"},{"@xml:lang":"sl","#text":"samosestavljivost"},{"@xml:lang":"en","#text":"self-assembling"}],"dc:title":{"@xml:lang":"sl","#text":"Parallelism of stable traces|"},"dc:description":[{"@xml:lang":"sl","#text":"A parallel ?$d$?-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex ?$v$?, there is no subset ?$X \\subseteq N(v)$? with ?$1 \\leq |N| \\leq d$? such that every time the walk enters ?$v$? from ?$X$?, it also exits to a vertex in ?$X$?. In the past, ?$d$?-stable traces were investigated as a mathematical model for an innovative biotechnological procedure - self-assembling of polypeptide structures. Among other, it was proven that graphs that admit parallel ?$d$?-stable traces are precisely Eulerian graphs with minimum degree strictly larger than ?$d$?. In the present paper we give an alternative, purely combinatorial proof of this result"},{"@xml:lang":"sl","#text":"Paralelen ?$d$?-stabilen obhod je sklenjen sprehod, ki vsako povezava grafa prečka natanko dvakrat v isti smeri, pri tem pa za vsako vozlišče ?$v$? velja, da ne obstaja taka podmnožica njegovih sosedov ?$X \\subseteq N(v)$v, v$1 \\leq |X| \\leq d$?, da vsakič, ko sprehod pride v v$v$v iz vozlišča v ?$X$?, tudi zapusti ?$v$? v smeri proti vozlišču v ?$X$?. V preteklosti so bili ?$d$?-stabilni obhodi, kot matematični model za nove in inovativne biotehnološke raziskave, že raziskani. Med drugim so bili grafi, ki vsebujejo paralalne ?$d$?-stabilne obhode karakterizirani kot Eulerjevi grafi z minimalno stopnjo ?$\\delta > d$?. V pričujočem članku je podan alternativni (kombinatorični) dokaz tega rezultata"}],"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-PHIQC6HV","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-PHIQC6HV"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-PHIQC6HV/d10a4d23-0e69-4871-8cc6-7f97bac019da/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-PHIQC6HV/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-PHIQC6HV"}}}}