<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-F34KIT16</identifier><date>2021</date><creator>Gavrilyuk, Alexander</creator><creator>Vidali, Janoš</creator><creator>Williford, Jason S.</creator><relation>documents/doc/F/URN_NBN_SI_doc-F34KIT16_001.pdf</relation><relation>documents/doc/F/URN_NBN_SI_doc-F34KIT16_001.txt</relation><format format_type="issue">1</format><format format_type="volume">20</format><format format_type="type">article</format><format format_type="extent">str. 103-127</format><identifier identifier_type="DOI">10.26493/1855-3974.2101.b76</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="COBISSID_HOST">82396163</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-F34KIT16</identifier><language>eng</language><publisher publisher_location="Koper">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="slv">asociativna shema</subject><subject language_type_id="eng">association scheme</subject><subject language_type_id="eng">distance-regular graph</subject><subject language_type_id="slv">dopustni parametri</subject><subject language_type_id="eng">feasible parameters</subject><subject language_type_id="slv">Q-polinomska lastnost</subject><subject language_type_id="eng">Q-polynomial</subject><subject language_type_id="slv">razdaljno regularen graf</subject><title>On few-class Q-polynomial association schemes: feasible parameters and nonexistence results</title></Record>