{"?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-Z17NLJH9/09c098bc-667c-4bf4-981a-d1cce01f4b29/PDF","dcterms:extent":"351 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-Z17NLJH9/fe093809-e477-48d6-9d1a-83117132444b/TEXT","dcterms:extent":"24 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-Z17NLJH9","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2016","dc:creator":"Stevanović, Dragan","dc:format":[{"@xml:lang":"sl","#text":"letnik:11"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"str. 415-423"}],"dc:identifier":["COBISSID:1538772420","ISSN:1855-3966","URN:URN:NBN:SI:doc-Z17NLJH9"],"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":"adjacency matrix"},{"@xml:lang":"en","#text":"eigenvector"},{"@xml:lang":"sl","#text":"lastni vektorji"},{"@xml:lang":"sl","#text":"matrika sosednosti"},{"@xml:lang":"sl","#text":"Wilfov problem"},{"@xml:lang":"en","#text":"Wilf's problem"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"On plus/minus 1 eigenvectors of graphs|"},"dc:description":[{"@xml:lang":"sl","#text":"While discussing his spectral bound on the independence number of a graph, Herbert Wilf asked back in 1986 what kind of a graph admits an eigenvector consisting solely of ?$\\pm 1$? entries? We prove that Wilf's problem is NP-complete, but also that the set of graphs having a ?$\\pm 1$? eigenvector is quite rich, being closed under a number of different graph compositions"},{"@xml:lang":"sl","#text":"Ko je obravnaval svojo spektralno mejo za neodvisnostno število grafa, je Herbert Wilf leta 1986 zastavil vprašanje, kakšna vrsta grafa dopušča lastni vektor, ki sestoji samo iz ?$\\pm 1$? komponent? Dokažemo, da je Wilfov problem NP-poln, pa tudi, da je množica grafov, ki imajo ?$\\pm 1$? lastni vektor precej bogata, saj je zaprta za številne različne kompozicije grafov"}],"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-Z17NLJH9","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-Z17NLJH9"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-Z17NLJH9/09c098bc-667c-4bf4-981a-d1cce01f4b29/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-Z17NLJH9/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-Z17NLJH9"}}}}