<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-EXBJK8SJ</identifier><date>2019</date><creator>Kubota, Sho</creator><creator>Taniguchi, Tetsuji</creator><creator>Yoshino, Kiyoto</creator><relation>documents/doc/E/URN_NBN_SI_doc-EXBJK8SJ_001.pdf</relation><relation>documents/doc/E/URN_NBN_SI_doc-EXBJK8SJ_001.txt</relation><format format_type="volume">17</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 555-579</format><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="COBISSID_HOST">18965593</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-EXBJK8SJ</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">Hoffman graph</subject><subject language_type_id="slv">Hoffmanov graf</subject><subject language_type_id="eng">line graph</subject><subject language_type_id="slv">najmanjša lastna vrednost</subject><subject language_type_id="slv">povezavni graf</subject><subject language_type_id="eng">smallest eigenvalue</subject><title>On graphs with the smallest eigenvalue at least -1- square root 2, part III</title></Record>