{"?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-C0WY5SN0/137d4465-815d-4667-ada0-3d0bd100a678/PDF","dcterms:extent":"357 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-C0WY5SN0/76116524-ebf5-400e-8443-b6c25cedc757/TEXT","dcterms:extent":"26 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-C0WY5SN0","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2019","dc:creator":["Iršič, Vesna","Konvalinka, Matjaž"],"dc:format":[{"@xml:lang":"sl","#text":"letnik:17"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"str. 481-491"}],"dc:identifier":["ISSN:1855-3966","COBISSID_HOST:18796121","URN:URN:NBN:SI:doc-C0WY5SN0"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"en","#text":"(complete) bipartite graphs"},{"@xml:lang":"en","#text":"(complete) multipartite graphs"},{"@xml:lang":"sl","#text":"(polni) dvodelni graf"},{"@xml:lang":"sl","#text":"(polni) večdelni graf"},{"@xml:lang":"en","#text":"geodetic problem"},{"@xml:lang":"sl","#text":"geodetski problem"},{"@xml:lang":"sl","#text":"krepki geodetski problem"},{"@xml:lang":"en","#text":"strong geodetic problem"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Strong geodetic problem on complete multipartite graphs|"},"dc:description":[{"@xml:lang":"sl","#text":"The strong geodetic problem is to find the smallest number of vertices such that by fixing one shortest path between each pair, all vertices of the graph are covered. In this paper we study the strong geodetic problem on complete bipartite graphs. Some results for complete multipartite graphs are also derived. Finally, we prove that the strong geodetic problem restricted to (general) bipartite graphs is NP-complete"},{"@xml:lang":"sl","#text":"Pri krepkem geodetskem problemu moramo poiskati najmanjše število vozlišč, tako da z izborom ene najkrajše poti med vsakim parom vozlišč pokrijemo vsa vozlišča grafa. V tem članku preučujemo krepko geodetsko število na polnih dvodelnih grafih. Izpeljemo tudi nekatere rezultate za polne večdelne grafe. Dokažemo tudi, da je krepki geodetski problem na (spošnih) dvodelnih grafih NP-poln"}],"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-C0WY5SN0","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-C0WY5SN0"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-C0WY5SN0/137d4465-815d-4667-ada0-3d0bd100a678/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-C0WY5SN0/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-C0WY5SN0"}}}}