<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-LN5JUSNT</identifier><date>2018</date><creator>Mednykh, Ilya</creator><relation>documents/doc/L/URN_NBN_SI_doc-LN5JUSNT_001.pdf</relation><relation>documents/doc/L/URN_NBN_SI_doc-LN5JUSNT_001.txt</relation><format format_type="volume">15</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 467-485</format><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="COBISSID">18596697</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-LN5JUSNT</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="slv">I-graf</subject><subject language_type_id="slv">Jacobijeva grupa</subject><subject language_type_id="slv">Petersenov graf</subject><subject language_type_id="slv">polinom Čebiševa</subject><subject language_type_id="slv">vpeto drevo</subject><title>On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials</title></Record>