<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-Z17NLJH9</identifier><date>2016</date><creator>Stevanović, Dragan</creator><relation>documents/doc/Z/URN_NBN_SI_doc-Z17NLJH9_001.pdf</relation><relation>documents/doc/Z/URN_NBN_SI_doc-Z17NLJH9_001.txt</relation><format format_type="volume">11</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 415-423</format><identifier identifier_type="COBISSID">1538772420</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-Z17NLJH9</identifier><language>eng</language><publisher>Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">adjacency matrix</subject><subject language_type_id="eng">eigenvector</subject><subject language_type_id="slv">lastni vektorji</subject><subject language_type_id="slv">matrika sosednosti</subject><subject language_type_id="slv">Wilfov problem</subject><subject language_type_id="eng">Wilf's problem</subject><title>On plus/minus 1 eigenvectors of graphs</title></Record>